To be precise that script searches a list of 37k unique names in 0.179 seconds and this includes starting Python.
That said, some googling turned up this page showing fast levenshtein from a list of words with a trie:
http://efreedom.com/Question/1-2918771/Optimizing-Levenshtein-Distance-Algorithm
To be precise that script searches a list of 37k unique names in 0.179 seconds and this includes starting Python.
That said, some googling turned up this page showing fast levenshtein from a list of words with a trie:
http:// efreedom. com/Question/ 1-2918771/ Optimizing- Levenshtein- Distance- Algorithm