Source: libtext-levenshtein-perl
Maintainer: Debian Perl Group <pkg-perl-maintainers@lists.alioth.debian.org>
Uploaders: Ryan Niebur <ryan@debian.org>,
           gregor herrmann <gregoa@debian.org>
Section: perl
Priority: optional
Build-Depends: debhelper (>= 9)
Build-Depends-Indep: perl,
                     perl (>= 5.19.7) | libunicode-collate-perl (>= 1.04)
Standards-Version: 3.9.6
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-perl/packages/libtext-levenshtein-perl.git
Vcs-Git: git://anonscm.debian.org/pkg-perl/packages/libtext-levenshtein-perl.git
Homepage: https://metacpan.org/release/Text-Levenshtein
Testsuite: autopkgtest-pkg-perl

Package: libtext-levenshtein-perl
Architecture: all
Depends: ${perl:Depends},
         ${misc:Depends},
         perl (>= 5.19.7) | libunicode-collate-perl (>= 1.04)
Description: implementation of the Levenshtein edit distance
 Text::Levenshtein implements the Levenshtein edit distance. 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.