An XS implementation of the Levenshtein edit distance
http://search.cpan.org/dist/Text-LevenshteinXS
This module implements the Levenshtein edit distance in a XS way.
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:
- Sources inherited from project devel:languages:perl
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout home:Tomcat42/perl-Text-LevenshteinXS && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| Text-LevenshteinXS-0.03.tar.gz | 0000003063 2.99 KB | |
| perl-Text-LevenshteinXS.changes | 0000000153 153 Bytes | |
| perl-Text-LevenshteinXS.spec | 0000002422 2.37 KB |
Comments 0