Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #45472
| Subject | Re: Diacretical incensitive search |
|---|---|
| From | Petite Abeille <petite.abeille@gmail.com> |
| Date | 2013-05-17 09:15 +0200 |
| References | <20130517085704.3f6609e8@pcolivier.chezmoi.net> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.1782.1368774962.3114.python-list@python.org> (permalink) |
On May 17, 2013, at 8:57 AM, Olive <diolu.remove_this_part@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
Back to comp.lang.python | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Diacretical incensitive search Olive <diolu.remove_this_part@bigfoot.com> - 2013-05-17 08:57 +0200
Re: Diacretical incensitive search Petite Abeille <petite.abeille@gmail.com> - 2013-05-17 09:15 +0200
Re: Diacretical incensitive search Peter Otten <__peter__@web.de> - 2013-05-17 10:30 +0200
Re: Diacretical incensitive search Olive <diolu.remove_this_part@bigfoot.com> - 2013-05-17 17:37 +0200
Re: Diacretical incensitive search jmfauth <wxjmfauth@gmail.com> - 2013-05-17 10:31 -0700
Re: Diacretical incensitive search Jorgen Grahn <grahn+nntp@snipabacken.se> - 2013-05-20 09:10 +0000
csiph-web