Binary package “libtext-levenshteinxs-perl” in ubuntu trusty
XS implementation of the Levenshtein edit distance
Text::
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: <http://
Published versions
- libtext-levenshteinxs-perl 0.03-3build2 in amd64 (Release)
- libtext-levenshteinxs-perl 0.03-3build3 in amd64 (Proposed)
- libtext-levenshteinxs-perl 0.03-3build3 in amd64 (Release)
- libtext-levenshteinxs-perl 0.03-3build3 in arm64 (Proposed)
- libtext-levenshteinxs-perl 0.03-3build3 in arm64 (Release)
- libtext-levenshteinxs-perl 0.03-3build2 in armhf (Release)
- libtext-levenshteinxs-perl 0.03-3build3 in armhf (Proposed)
- libtext-levenshteinxs-perl 0.03-3build3 in armhf (Release)
- libtext-levenshteinxs-perl 0.03-3build2 in i386 (Release)
- libtext-levenshteinxs-perl 0.03-3build3 in i386 (Proposed)
- libtext-levenshteinxs-perl 0.03-3build3 in i386 (Release)
- libtext-levenshteinxs-perl 0.03-3build2 in powerpc (Release)
- libtext-levenshteinxs-perl 0.03-3build3 in powerpc (Proposed)
- libtext-levenshteinxs-perl 0.03-3build3 in powerpc (Release)
- libtext-levenshteinxs-perl 0.03-3build3 in ppc64el (Release)