Creating words by structure

Question

Context

As a conlanger, I am interested in creating a uniform, naturalistic language. One of the tricks is to create vocabulary according to certain structures of words. An example from English: In English, we have the word "tap" structured consonant-vowel-consonant. Usually, this means that there are many other words of this structure: "cat", "dog", "rock", "fog", "good", etc.

Task

As input, you have:

• an array C containing strings: consonants (C is the first letter in the word consonants). Identical consonants cannot be repeated on this list. For example, this list cannot contain ['b', 'b'].
• an array V containing strings: vowels (V is the first letter of the word vowels). Identical vowels cannot be repeated on this list.
• string S, which contains something like this "CVCCV" (any combination of "C" and "V")

Your task is to replace "C" in the string with a randomly taken string from array C and replace "V" in the string with a randomly taken string from array V and return (or display) this string.

"randomly" is defined as all possibilities having an equal chance of being selected. This is a kind of simplification: in real languages as well as in conlangs, ​​there are very frequent (for example 'r' in English) and not very frequent sounds but this is just a code-golf.

Rules

This is code-golf so the lowest byte count wins.

Examples

Input:
C = ['p', 'b', 't', 'd', 'k', 'g', 'm', 'n', 'w']
V = ['a', 'o', 'u', 'i', 'e', 'ä']
S = 'CVCCV'
Output:
pakto

Input:
C = ['p', 'b', 't', 'd', 'k', 'g', 'v', 's', 'r']
V = ['a', 'o', 'u', 'i', 'e', 'ä', 'ᵫ']
S = 'CVVCCVCCV'
Output:
koebrᵫvtä

Answer 1

05AB1E, 4 bytes

Takes input as S, [V,C]

Çè€Ω

Try it online!

Answer 2

Jelly, (削除) 5 (削除ここまで) 4 bytes

-1 thanks to Neil!

OịX€

A dyadic Link accepting a list of characters, S, on the left and a list of two lists of characters, [C, V], on the right which yields a list of characters.

Try it online!

If we could take S as a list of 1s and 0s we'd have the three byte solution ịX€.

How?

OịX€ - Link: S, [C,V]
O - ordinals (of S) i.e. 'C':67 'V':86
 ị - index into [C,V] (vectorises) C V [Jelly indexing is 1-indexed and modular]
 € - for each:
 X - random choice

• RGS: I like both solutions! The 5 and the 3 byte ones +1
• Neil: What does Jelly do if an index is out of range? (Charcoal automatically reduces it modulo the range, so I don't need to extract the bit manually.)
• Jonathan Allan: @Neil you just saved a byte - thanks! I even noted in my code break-down that "Jelly indexing is 1-indexed and modular".

Answer 3

Python 3, (削除) 92 (削除ここまで) (削除) 68 (削除ここまで) 61 bytes

Takes input as S, C, V:

lambda s,*w:[random.choice(w[a>"u"])for a in s]
import random

You can try it online! How it works:

The *w is used so that the lists of consonants and vowels are packed in a list w.

When we do w[a > "u"] we are essentially checking if a (a character of s) is "v" or not. If it is, then a > "u" returns True, which indexes as 1 into w. If a is "c", then a > "u" returns False, which indexes as 0.

We use those indices to retrieve the correct list of letters from w and then choose randomly from that list, picking the list of choices.

Thanks @Arnauld for saving one byte and to @Jonathan Allan for citing this meta, saving me 7 bytes.

• S.S. Anne: This is what I would've done in my C solution had it not been for that the lists of consonants and vowels are not of equal length.
• Jonathan Allan: I believe that you should be able to take s as a list of characters and return the same (see this meta) and as such can replace the "".join(...) with [...].
• RGS: @JonathanAllan thanks for this reference! Shaved 7 bytes :)

Answer 4

APL+WIN, (削除) 35 (削除ここまで) 34 bytes

One byte saved thanks to Adam

Prompts for consonants and vowels as continuous strings and the desired output as a comma separated string

c←⍞⋄v←⍞⋄C←',c[?⍴c]'⋄V←',v[?⍴v]'⋄⍎⎕

Try it online! Courtesy of Dyalog Classic

• USERNAME GOES HERE: If you liked this golf question, please vote to reopen it.
• user92069: If you don't like this golf challenge, please retain its closed state.
• Graham: This is the first time I have been lobbied from both sides of a question closure. Personally I had no problem understanding the question and as I got two up votes I assume at least two people agreed with my interpretation and my answer
• Adám: By using ⍞ instead of ⎕ you can specify that input shouldn't have quotes, and then use ⎕ instead of ⍎⎕ to save a byte: Try it online!
• Graham: @Adám Thanks for the suggestion but whilst it works in Dyalog Classic I cannot get it to work in APL+WIN. If I run the code as you suggest it simply outputs the concatenated code string which needs the second ⍎ to execute.

Answer 5

Ruby, (削除) 45 (削除ここまで) 40 bytes

->s,*l{s.bytes.map{|x|l[x%2].sample}*''}

Try it online!

• USERNAME GOES HERE: I didn't think that ruby could outgolf python. Great!
• G B: Ruby code is usually shorter than the equivalent python code.

Answer 6

Charcoal, 7 bytes

⭆η‽§θc/oι

Try it online! Link is to verbose version of code. Takes the input in the form [V, C], S where each value can be either a string or an array of characters as desired. Explanation:

 η `S`
⭆ Map over elements/characters
 θ `[V, C]`
 § Cyclically indexed by
 c/o Ordinal of
 ι Current element/character
 ‽ Random element/character
 Implicitly print

Answer 7

C# (Visual C# Interactive Compiler), 66 bytes

(C,V,s)=>s.Select(x=>(x<68?C:V).OrderBy(l=>Guid.NewGuid()).Last())

Try it online!

Answer 8

Japt, 6 bytes

ËcgV ö

Takes input as S, [V,C]

Try it

• USERNAME GOES HERE: @a'_' Ok.6 more to go...
• USERNAME GOES HERE: @a'_' By the way, did you like this code-golf question?
• user92069: @VictorVosMottorthanksMonica I loved it. But it was blatant that I can't re-open it, because I don't have enough reputation to do so.
• Shaggy: @VictorVosMottorthanksMonica, liking a challenge is not a valid reason to VTR it. Address the issues that led to it being closed and, once done so to the community's satisfaction, it will be reopened.
• Shaggy: @a'_', similarly, not liking a challenge is not grounds for closing it or leaving it closed. There have been many challenges here over the years I haven't personally liked, as there have been for everyone - if you don't like a challenge, just skip it and move on to the next one.

Answer 9

W f j, 4 bytes

Hmm, let's do a pure-ASCII port of that.

C[gr

Explanation

C % Convert the string to its codepoints
 [ % Index into the other list
 r % For every indexed item:
 g % "g"et a random item in this list
Flag:f % Flatten the output list
Flag:j % Join the flattened output list
```

• user92069: @KevinCruijssen I absolutely can't understand the challenge, so feel free to post your answer so that I can get a better understanding of this. (I guess I'd keep it deleted because I don't know how to fix it.)

Answer 10

PHP, 68 bytes

function($C,$V,$s){for(;$r=$s[$i++];)echo$$r[rand(0,count($$r)-1)];}

Try it online!

Answer 11

C (gcc), 92 bytes

f(s,c,v,m,n)char*s,**c,**v;{for(srand(&s);*s;)printf("%s",*s++/86?v[rand()%n]:c[rand()%m]);}

Takes as input a string (s), an array of consonant strings (c), an array of vowel strings v, the length of c (m), and the length of v (n).

Could use a temporary variable for the result of rand but it wouldn't save me anything.

Try it online!

Answer 12

JavaScript (ES6), (削除) 65 (削除ここまで) 64 bytes

(C,V,s)=>s.replace(/./g,x=>eval(x).sort(_=>Math.random()-.5)[0])

Try it online!

Or 55 bytes if we can use an array of characters as I/O.

• RGS: The eval trick is really nice! Sadly enough I don't think I can use it in my answer to save some bytes :(
• Jonathan Allan: 55 seems fine unless OP has explicitly said not since I==O and if it quacks like a duck, it is a duck (i.e. strings are lists of characters)
• Neil: @a'_' I think I'm privileged enough to hammer this question, which I think would be inappropriate either way.