Fast implementation of the 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).
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 1.0.0-3.fc35 | - |
Fedora 35 | 1.0.0-3.fc35 | - |
You can contact the maintainers of this package via email at
python-editdistance-s dash maintainers at fedoraproject dot org
.