3 ms·
> no knowledge of how languages are formed I recommend reading this article. The problem he is solving is representing text in ASCII. For example an e with a
by rogerbinns 8y ago
> no knowledge of how languages are formed
I recommend reading this article. The problem he is solving is representing text in ASCII. For example an e with an accent can be replaced with a plain e. But what about languages not using the base Roman alphabet? You get a fascinating tour of Divehi and the final result - the unidecode module - works rather well.
http://interglacial.com/tpj/22/ http://interglacial.com/tpj/22/
- logfromblammo 8y ago> "I am rather sure, however, that it cannot be done with a mere regular expression, and that is not something I say lightly!" This sounds like a challenge.