Edit down to a stub to save space

Source Link

edited May 24, 2022 at 18:02

12.8k
1
10
17

Eh, codegolf shmodegolf

Has been posted here!

This challenge is about implementing Shm-reduplication, originating in Yiddish, where one takes a word, duplicates it, and replaces the first syllable in the second word with "Shm" in order to indicate that one does not care. Some examples include:

word -> word shmord

baby -> baby shmaby

sale -> sale shmale

Rules

In the real world there are a bunch of special cases, but for this challenge we will use rules that describe a simplified version of the full linguistic phenomenon that is more suitable for programming:

Consonants up to first vowel are replaced by "shm".

Prepend shm to words beginning with vowels.

If a word contains no vowels it is returned unchanged. No vowel, no shm.

The vowels are: a, e, i, o, u.

The input will be restricted to lowercase letters.

The output should be a string containing the the reduplicated version of the input. If the input is "string" the output should be "shming".

This is code golf, shortest code wins!

Example solution (ungolfed python)

This is an example of code that would solve the challenge:

def function_shmunction(string):
    vowels = "aeiou"
    for letter in string:
        if letter in vowels:
            index = string.index(letter)
            shming = "shm" + string[index:]
            return shming
    return string

Test casesEh, codegolf shmodegolf

function -> shmunction

stellar -> shmellar

atypical -> shmatypical

wwwhhhat -> shmat

aaaaaaaaaa -> shmaaaaaaaaaa

lrr -> lrr

Eh, codegolf shmodegolf

Has been posted here!

This challenge is about implementing Shm-reduplication, originating in Yiddish, where one takes a word, duplicates it, and replaces the first syllable in the second word with "Shm" in order to indicate that one does not care. Some examples include:

word -> word shmord

baby -> baby shmaby

sale -> sale shmale

Rules

In the real world there are a bunch of special cases, but for this challenge we will use rules that describe a simplified version of the full linguistic phenomenon that is more suitable for programming:

Consonants up to first vowel are replaced by "shm".

Prepend shm to words beginning with vowels.

If a word contains no vowels it is returned unchanged. No vowel, no shm.

The vowels are: a, e, i, o, u.

The input will be restricted to lowercase letters.

The output should be a string containing the the reduplicated version of the input. If the input is "string" the output should be "shming".

This is code golf, shortest code wins!

Example solution (ungolfed python)

This is an example of code that would solve the challenge:

def function_shmunction(string):
    vowels = "aeiou"
    for letter in string:
        if letter in vowels:
            index = string.index(letter)
            shming = "shm" + string[index:]
            return shming
    return string

Test cases

function -> shmunction

stellar -> shmellar

atypical -> shmatypical

wwwhhhat -> shmat

aaaaaaaaaa -> shmaaaaaaaaaa

lrr -> lrr

Eh, codegolf shmodegolf

Added link to the post on the main codegolf forum.

Source Link

edited May 24, 2022 at 8:19

JSorngard

973
5
4

Eh, codegolf shmodegolf

Has been posted here!

This challenge is about implementing Shm-reduplication, originating in Yiddish, where one takes a word, duplicates it, and replaces the first syllable in the second word with "Shm" in order to indicate that one does not care. Some examples include:

word -> word shmord
baby -> baby shmaby
sale -> sale shmale

Rules

In the real world there are a bunch of special cases, but for this challenge we will use rules that describe a simplified version of the full linguistic phenomenon that is more suitable for programming:

Consonants up to first vowel are replaced by "shm".
Prepend shm to words beginning with vowels.
If a word contains no vowels it is returned unchanged. No vowel, no shm.
The vowels are: a, e, i, o, u.
The input will be restricted to lowercase letters.
The output should be a string containing the the reduplicated version of the input. If the input is "string" the output should be "shming".

This is code golf, shortest code wins!

Example solution (ungolfed python)

This is an example of code that would solve the challenge:

def function_shmunction(string):
    vowels = "aeiou"
    for letter in string:
        if letter in vowels:
            index = string.index(letter)
            shming = "shm" + string[index:]
            return shming
    return string

Test cases

function -> shmunction
stellar -> shmellar
atypical -> shmatypical
wwwhhhat -> shmat
aaaaaaaaaa -> shmaaaaaaaaaa
lrr -> lrr

Eh, codegolf shmodegolf

This challenge is about implementing Shm-reduplication, originating in Yiddish, where one takes a word, duplicates it, and replaces the first syllable in the second word with "Shm" in order to indicate that one does not care. Some examples include:

word -> word shmord
baby -> baby shmaby
sale -> sale shmale

Rules

In the real world there are a bunch of special cases, but for this challenge we will use rules that describe a simplified version of the full linguistic phenomenon that is more suitable for programming:

Consonants up to first vowel are replaced by "shm".
Prepend shm to words beginning with vowels.
If a word contains no vowels it is returned unchanged. No vowel, no shm.
The vowels are: a, e, i, o, u.
The input will be restricted to lowercase letters.
The output should be a string containing the the reduplicated version of the input. If the input is "string" the output should be "shming".

This is code golf, shortest code wins!

Example solution (ungolfed python)

This is an example of code that would solve the challenge:

def function_shmunction(string):
    vowels = "aeiou"
    for letter in string:
        if letter in vowels:
            index = string.index(letter)
            shming = "shm" + string[index:]
            return shming
    return string

Test cases

function -> shmunction
stellar -> shmellar
atypical -> shmatypical
wwwhhhat -> shmat
aaaaaaaaaa -> shmaaaaaaaaaa
lrr -> lrr

Eh, codegolf shmodegolf

Has been posted here!

This challenge is about implementing Shm-reduplication, originating in Yiddish, where one takes a word, duplicates it, and replaces the first syllable in the second word with "Shm" in order to indicate that one does not care. Some examples include:

word -> word shmord
baby -> baby shmaby
sale -> sale shmale

Rules

In the real world there are a bunch of special cases, but for this challenge we will use rules that describe a simplified version of the full linguistic phenomenon that is more suitable for programming:

Consonants up to first vowel are replaced by "shm".
Prepend shm to words beginning with vowels.
If a word contains no vowels it is returned unchanged. No vowel, no shm.
The vowels are: a, e, i, o, u.
The input will be restricted to lowercase letters.
The output should be a string containing the the reduplicated version of the input. If the input is "string" the output should be "shming".

This is code golf, shortest code wins!

Example solution (ungolfed python)

This is an example of code that would solve the challenge:

def function_shmunction(string):
    vowels = "aeiou"
    for letter in string:
        if letter in vowels:
            index = string.index(letter)
            shming = "shm" + string[index:]
            return shming
    return string

Test cases

function -> shmunction
stellar -> shmellar
atypical -> shmatypical
wwwhhhat -> shmat
aaaaaaaaaa -> shmaaaaaaaaaa
lrr -> lrr

Moved io restrictions into the numbered list of rules for clarity

Source Link

edited May 23, 2022 at 14:15

JSorngard

973
5
4

Eh, codegolf shmodegolf

This challenge is a very unbaked idea about implementing Shm-reduplication, originating in Yiddish, where one takes a word, duplicates it, and replaces the first syllable in the second word with "Shm" in order to indicate that one does not care. Some examples include:

word -> word shmord
baby -> baby shmaby
sale -> sale shmale

Rules

TheseIn the real world there are a bunch of special cases, but for this challenge we will use rules that describe a simplified version of the full linguistic phenomenon that is more suitable for programming:

Consonants up to first vowel are replaced by "shm".
Prepend shm to words beginning with vowels.
If a word contains no vowels it is returned unchanged. No vowel, no shm.
The vowels are: a, e, i, o, u.

The input will be restricted to lowercase letters.

The output should be a string containing the the reduplicated version of the input. If the input is "string" the output should be "shming".

The input will be restricted to lowercase letters.
The output should be a string containing the the reduplicated version of the input. If the input is "string" the output should be "shming".

This is code golf, shortest code wins!

Example solution (ungolfed python)

This is an example of code that would solve the challenge, as currently defined.:

def function_shmunction(string):
    vowels = "aeiou"
    for letter in string:
        if letter in vowels:
            index = string.index(letter)
            shming = "shm" + string[index:]
            return shming
    return string

Test cases

function -> shmunction
stellar -> shmellar
atypical -> shmatypical
wwwhhhat -> shmat
aaaaaaaaaa -> shmaaaaaaaaaa
lrr -> lrr

Eh, codegolf shmodegolf

This is a very unbaked idea about implementing Shm-reduplication, originating in Yiddish, where one takes a word, duplicates it, and replaces the first syllable in the second word with "Shm" in order to indicate that one does not care. Some examples include:

word -> word shmord
baby -> baby shmaby
sale -> sale shmale

Rules

These rules describe a simplified version of the full linguistic phenomenon that is more suitable for programming:

Consonants up to first vowel are replaced by "shm".
Prepend shm to words beginning with vowels.
If a word contains no vowels it is returned unchanged. No vowel, no shm.
The vowels are: a, e, i, o, u.

The input will be restricted to lowercase letters.
The output should be a string containing the the reduplicated version of the input. If the input is "string" the output should be "shming".

This is code golf, shortest code wins!

Example solution (ungolfed python)

This is an example of code that would solve the challenge, as currently defined.

def function_shmunction(string):
    vowels = "aeiou"
    for letter in string:
        if letter in vowels:
            index = string.index(letter)
            shming = "shm" + string[index:]
            return shming
    return string

Test cases

function -> shmunction
stellar -> shmellar
atypical -> shmatypical
wwwhhhat -> shmat
aaaaaaaaaa -> shmaaaaaaaaaa
lrr -> lrr

Eh, codegolf shmodegolf

This challenge is about implementing Shm-reduplication, originating in Yiddish, where one takes a word, duplicates it, and replaces the first syllable in the second word with "Shm" in order to indicate that one does not care. Some examples include:

word -> word shmord
baby -> baby shmaby
sale -> sale shmale

Rules

In the real world there are a bunch of special cases, but for this challenge we will use rules that describe a simplified version of the full linguistic phenomenon that is more suitable for programming:

Consonants up to first vowel are replaced by "shm".
Prepend shm to words beginning with vowels.
If a word contains no vowels it is returned unchanged. No vowel, no shm.
The vowels are: a, e, i, o, u.

The input will be restricted to lowercase letters.

The output should be a string containing the the reduplicated version of the input. If the input is "string" the output should be "shming".

This is code golf, shortest code wins!

Example solution (ungolfed python)

This is an example of code that would solve the challenge:

def function_shmunction(string):
    vowels = "aeiou"
    for letter in string:
        if letter in vowels:
            index = string.index(letter)
            shming = "shm" + string[index:]
            return shming
    return string

Test cases

function -> shmunction
stellar -> shmellar
atypical -> shmatypical
wwwhhhat -> shmat
aaaaaaaaaa -> shmaaaaaaaaaa
lrr -> lrr

Boldened Test cases heading

Source Link

edited May 23, 2022 at 10:55

JSorngard

973
5
4

Loading

Added acknowledgement that this is not actually the complete "shm-reduplication" phenomenon

Source Link

edited May 23, 2022 at 9:14

JSorngard

973
5
4

Loading

Changed output format

Source Link

edited May 23, 2022 at 8:54

JSorngard

973
5
4

Loading

Added output format restrictions

Source Link

edited May 23, 2022 at 8:46

JSorngard

973
5
4

Loading

Moved description of input being lowercase to a better location

Source Link

edited May 20, 2022 at 19:32

JSorngard

973
5
4

Loading

code humour

Source Link

edited May 20, 2022 at 12:57

JSorngard

973
5
4

Loading

Clarified challenge rules. Corrected code to solve challenge

Source Link

edited May 20, 2022 at 10:47

JSorngard

973
5
4

Loading

Removed crossed out text, added more test cases, specified what should be done if the input has no vowels

Source Link

edited May 19, 2022 at 15:29

JSorngard

973
5
4

Loading

Corrected code whitespace

Source Link

edited May 19, 2022 at 11:06

JSorngard

973
5
4

Loading

Crossed out initialisms

Source Link

edited May 19, 2022 at 10:34

JSorngard

973
5
4

Loading

Added example solution, added restrictions to input

Source Link

edited May 19, 2022 at 9:36

JSorngard

973
5
4

Loading

Source Link

created May 18, 2022 at 9:26

JSorngard

973
5
4

Loading

Stack Exchange Network

Return to Answer

Eh, codegolf shmodegolf

Rules

Example solution (ungolfed python)

Test casesEh, codegolf shmodegolf

Eh, codegolf shmodegolf

Rules

Example solution (ungolfed python)

Test cases

Eh, codegolf shmodegolf

Eh, codegolf shmodegolf

Rules

Example solution (ungolfed python)

Test cases

Eh, codegolf shmodegolf

Rules

Example solution (ungolfed python)

Test cases

Eh, codegolf shmodegolf

Rules

Example solution (ungolfed python)

Test cases

Eh, codegolf shmodegolf

Rules

Example solution (ungolfed python)

Test cases

Eh, codegolf shmodegolf

Rules

Example solution (ungolfed python)

Test cases

Eh, codegolf shmodegolf

Rules

Example solution (ungolfed python)

Test cases