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).
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 0.8.1-1.fc40 | - |
Fedora 40 | 0.8.1-1.fc40 | - |
Fedora 39 | 0.8.1-1.fc39 | - |
Fedora 38 | 0.6.2-1.fc38 | - |
You can contact the maintainers of this package via email at
python-editdistance dash maintainers at fedoraproject dot org
.