py38-editdistance

v 0.6.2 Updated: 1 year, 2 months ago

Fast implementation of the edit distance (Levenshtein distance).

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).

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).

+ Show more

https://github.com/aflc/editdistance