| 1 |
Source: libtext-levenshtein-perl |
| 2 |
Maintainer: Debian Perl Group <[email protected]> |
| 3 |
Uploaders: gregor herrmann <[email protected]> |
| 4 |
Section: perl |
| 5 |
Testsuite: autopkgtest-pkg-perl |
| 6 |
Priority: optional |
| 7 |
Build-Depends: debhelper-compat (= 13) |
| 8 |
Build-Depends-Indep: libunicode-collate-perl <!nocheck>, |
| 9 |
perl |
| 10 |
Standards-Version: 4.6.0 |
| 11 |
Vcs-Browser: https://salsa.debian.org/perl-team/modules/packages/libtext-levenshtein-perl |
| 12 |
Vcs-Git: https://salsa.debian.org/perl-team/modules/packages/libtext-levenshtein-perl.git |
| 13 |
Homepage: https://metacpan.org/release/Text-Levenshtein |
| 14 |
Rules-Requires-Root: no |
| 15 |
|
| 16 |
Package: libtext-levenshtein-perl |
| 17 |
Architecture: all |
| 18 |
Depends: ${misc:Depends}, |
| 19 |
${perl:Depends}, |
| 20 |
libunicode-collate-perl |
| 21 |
Description: implementation of the Levenshtein edit distance |
| 22 |
Text::Levenshtein implements the Levenshtein edit distance. The Levenshtein |
| 23 |
edit distance is a measure of the degree of proximity between two strings. |
| 24 |
This distance is the number of substitutions, deletions or insertions |
| 25 |
("edits") needed to transform one string into the other one (and vice versa). |
| 26 |
When two strings have distance 0, they are the same. |