libtext-levenshteinxs-perl binary package in openKylin Huanghe V3.0 amd64

 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.

Source package