From: nabblepop on

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
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