No votes yet

XS implementation of the Levenshtein edit distance
Text::LevenshteinXS implements the Levenshtein edit distance in a XS way; this
should be much faster than the pure Perl implementation.
The Levenshtein edit distance is a measure of the degree of proximity between
two strings. This distance is the number of substitutions, deletions or
insertions ("edits") needed to transform one string into the other one (and
vice versa). When two strings have distance 0, they are the same. A good
point to start is: <>

Application versions: 
File libtext-levenshteinxs-perl_0.03-3_armel.deb10.07 KB04/08/2013 - 21:24

libtext-levenshteinxs-perl (0.03-3) unstable; urgency=low

* Take over for the Debian Perl Group; Closes: #624444