PyFFS is a python implementation of Levenshtein automata, whose goal is to provide fast fuzzy search of words among a dictionary. The code is currently written in pure python so the speed gains are only relevant where searching through really big dictionaries. Tests on PyPy3.3 show promising results.
All the implementation is based on Fast String Correction with Levenshtein-Automata by Klaus Schulz , Stoyan Mihov.
This project has currently no documentation because I do not see anyone having an immediate use of it besides myself, if you feel it could be of any use to you or have any question feel free to contact me.