| 1 |
Source: libtext-levenshteinxs-perl |
| 2 |
Maintainer: Debian Perl Group <[email protected]> |
| 3 |
Uploaders: gregor herrmann <[email protected]> |
| 4 |
Section: perl |
| 5 |
Priority: optional |
| 6 |
Build-Depends: debhelper-compat (= 13), |
| 7 |
perl-xs-dev, |
| 8 |
perl:native |
| 9 |
Standards-Version: 3.9.5 |
| 10 |
Vcs-Browser: https://salsa.debian.org/perl-team/modules/packages/libtext-levenshteinxs-perl |
| 11 |
Vcs-Git: https://salsa.debian.org/perl-team/modules/packages/libtext-levenshteinxs-perl.git |
| 12 |
Homepage: https://metacpan.org/release/Text-LevenshteinXS |
| 13 |
Testsuite: autopkgtest-pkg-perl |
| 14 |
|
| 15 |
Package: libtext-levenshteinxs-perl |
| 16 |
Architecture: any |
| 17 |
Depends: ${misc:Depends}, |
| 18 |
${perl:Depends}, |
| 19 |
${shlibs:Depends} |
| 20 |
Description: XS implementation of the Levenshtein edit distance |
| 21 |
Text::LevenshteinXS implements the Levenshtein edit distance in a XS way; this |
| 22 |
should be much faster than the pure Perl implementation. |
| 23 |
. |
| 24 |
The Levenshtein edit distance is a measure of the degree of proximity between |
| 25 |
two strings. This distance is the number of substitutions, deletions or |
| 26 |
insertions ("edits") needed to transform one string into the other one (and |
| 27 |
vice versa). When two strings have distance 0, they are the same. |