Calculates the Levenshtein distance between two byte strings
Calculates the Levenshtein distance between two byte strings. The Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e., the so called edit distance). The Levenshtein distance between two sequences is given by the minimum number of operations needed to transform one sequence into the other, where an operation is an insertion, deletion, or substitution of a single element.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 0.2.2-40.fc42 | - |
Fedora 42 | 0.2.2-40.fc42 | - |
Fedora 41 | 0.2.2-38.fc41 | - |
Fedora 40 | 0.2.2-37.fc40 | - |
You can contact the maintainers of this package via email at
rubygem-levenshtein dash maintainers at fedoraproject dot org
.