Diacretical incensitive search
Petite Abeille
petite.abeille at gmail.com
Fri May 17 03:15:27 EDT 2013
On May 17, 2013, at 8:57 AM, Olive <diolu.remove_this_part at bigfoot.com> wrote:
> The algorithm to write such a function is trivial but there are a lot of mark we can put on a letter. It would be necessary to have the list of "a"'s with something on it. i.e. "à,á,ã", etc. and this for every letter. Trying to make such a list by hand would inevitably lead to some symbols forgotten (and would be tedious).
Perhaps of interest… Sean M. Burke Unidecode…
There appear to be several python implementations, e.g.:
https://pypi.python.org/pypi/Unidecode
More information about the Python-list
mailing list