|
Prev: Win32.client, DAO.DBEngine and exceeding the file sharing countlock
Next: internatinal jobs in USA free submet your resume
From: nabblepop on 2 Jul 2008 10:40 I'm working on spell suggestions for a list of places(~10^6) e.g pizza hut<boston<MA<USA, etc What data structure shall I use for max performance/efficiency? Typing pizza should yield something like pizza hut<boston<MA<USA pizza corner<...<... .... .... .... -- View this message in context: http://www.nabble.com/Spell-suggest-for-locations-tp18239043p18239043.html Sent from the Python - python-list mailing list archive at Nabble.com.
From: Miki on 3 Jul 2008 15:57
Hello, > I'm working on spell suggestions for a list of places(~10^6) e.g pizza > hut<boston<MA<USA, etc > What data structure shall I use for max performance/efficiency? > > Typing pizza should yield something like > > pizza hut<boston<MA<USA > pizza corner<...<... > ... > ... > ... A trie? (http://en.wikipedia.org/wiki/Trie). Googling for "spell checker algorithm" yields many results. HTH, -- Miki <miki.tebeka(a)gmail.com> http://pythonwise.blogspot.com |