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

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.

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

Answer 5

Ruby, 45 40 bytes

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

Try it online!

Answer 6

Charcoal, 7 bytes

⭆η‽§θ℅ι

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
     ℅  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

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
```

Answer 10

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.

Answer 11

PHP, 68 bytes

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

Try it online!

Answer 12

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!