Shameless plug: I have a Java library that does this even more efficiently. It constructs a Levenshtein automaton of a word in linear time and then computes the

Shameless plug: I have a Java library that does this even more efficiently. It constructs a Levenshtein automaton of a word in linear time and then computes the intersection between a dictionary (stored in a deterministic acyclic minimal finite state automaton) and the Levensthein automaton. It also has other features, such as: - Perfect hash automata (an automaton that gives a unique hash for every word/sequence). - String-keyed maps that use a finite state automaton to store keys. More info: https://github.com/danieldk/dictomaton https://github.com/danieldk/dictomaton http://search.maven.org/#artifactdetails%7Ceu.danieldk.dictomaton%7Cdictomaton%7C1.1.1%7Cjar http://search.maven.org/#artifactdetails%7Ceu.danieldk.dicto...