Fast implementation of the edit distance (Levenshtein distance).
This library simply implements Levenshtein distance with C++ and Cython.
The algorithm used in this library is proposed by Heikki Hyyrö,
"Explaining and extending the bit-parallel approximate string matching
algorithm of Myers", (2001).