FastSS is a string similarity searching algorithm. For each query, which

consists of query string s and distance d, it retrieves all the words in a
dictionary whose edit distance from s is equal or smaller than d. FastSS is an
offline searching algorithm, as it needs to create an index of its dictionary
before it can search. For more information on FastSS you can visit the website
of its inventors at <http://fastss.csg.uzh.ch/>.

Here are some of the characteristics of this implementation, to help you decide
whether it fits your purposes: