Hello.
I had an idea to make English, but each phoneme is swapped for an opposite. This is easy to do for vowels - for example, /i/ and /u/ are opposites, because one is front and the other is back. I tried to figure out a similar system for consonants and have been stuck ever since. So, how would you calculate an opposite for /m/, or /h/, or /r/? I’m sure there must be a way to do it, but for the life of me I can’t figure it out.


Yeah that’s the kinda thing I was thinking of re: vowels. I don’t know exactly what I want from the vowels, but it’s something like that.
Well, it’s a goofy baby-talk cipher, so I’m inclined to be pretty flexible with this.
I thought of that… I just think it would get too messy if I tried to be precise with this method. Maybe I just need another method.
Here’s my take. Just as a bunch of ideas, perhaps it’s helpful.
All sets were reorganised into a “pseudo-dialect” with seven vowels, no length. It shouldn’t correspond to any RL dialect, but still be close enough to be English. Almost all phonemes were paired, but:
Personally I’d go with the merry-go-round. Because it’s somewhat easy to force English into three sets of consonants, through the following changes /θ ð h/ → /f v Ø/ (all three associated with baby talk). Then you get the following:
labial: /m p b f v/ apical: /n t d s z/ dorsal: /ŋ k g ʃ ʒ/The only ones left behind are /t͡ʃ d͡ʒ l r j w/. I think /j w/ can be paired together (as if they were vowels), /l r/ (they often occur in similar environments), and then /t͡ʃ d͡ʒ/ can be analysed as sequences, so after “opposed” they end as /ps bz/, /kf gv/ or something like this, you get the idea.