Stemming & Hello!

[Daniël de Kok]

On Dec 28, 2012, at 4:59 AM, Mark Wotton <mwotton at gmail.com> wrote:
> oh, also: I've been playing around with a suggester using levenshtein
> distance to many possible target strings. This isn't the fastest thing
> in the world: is there a better algorithm in the literature?

If you are trying to find words at a small edit-distance, you might want to look at Burkhard-Keller trees:

http://blog.notdot.net/2007/4/Damn-Cool-Algorithms-Part-1-BK-Trees
http://www.kafsemo.org/2010/08/03_bk-tree-performance-notes.html

http://hackage.haskell.org/package/bk-tree

-- Daniël