No votes yet

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.

Application versions: 
File libtext-levenshtein-perl_0.06~01-2_all.deb6.76 KB05/08/2013 - 15:05

libtext-levenshtein-perl (0.06~01-2) unstable; urgency=low

[ Salvatore Bonaccorso ]
* debian/control: Changed: Replace versioned (build-)dependency on
perl (>= 5.6.0-{12,16}) with an unversioned dependency on perl (as
permitted by Debian Policy 3.8.3).

[ Ryan Niebur ]
* Email change: Ryan Niebur ->

[ Ansgar Burchardt ]
* debian/control: Convert Vcs-* fields to Git.

[ Dmitry Shachnev ]
* Fixed lintian warnings (Closes: #696639):
- ancient-standards-version: bumped to 3.9.4.
- debian-rules-missing-recommended-target: added build-arch and
build-indep targets.
- wiki-copyright-format-uri: updated debian/copyright to the latest
* Removed dead link from package description (Closes: #695754).

[ gregor herrmann ]
* debian/copyright: update license stanzas.
* Switch to "3.0 (quilt)" source format. Drop quilt build dependency.
Use shortform dh(1) in debian/rules.
* Use debhelper 8.
* Add /me to Uploaders.