Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
I was wondering isIs there a language that has a complete one-to-one correspondence between the graphemes (letters) and the phonemes of the language?
Or ratherIn other words, is there a language that is 100% ideally phonemic?
I was wondering is there a language that has a complete one-to-one correspondence between the graphemes (letters) and the phonemes of the language?
Or rather, is there a language that is 100% ideally phonemic?
Is there a language that has a complete one-to-one correspondence between the graphemes (letters) and the phonemes of the language?
In other words, is there a language that is 100% ideally phonemic?
