Bug#624444: O: libtext-levenshteinxs-perl -- An XS implementation of the Levenshtein edit distance
Adrian von Bidder, the maintainer of the libtext-levenshteinxs-perl
package unfortunately died on 17th of April 2011 .
Therefore, I orphan this package now. If you want to be the new
maintainer, please take it.
See http://www.debian.org/devel/wnpp/#howto-o for detailed instructions
how to adopt a package properly.
Some information about the package:
Depends: perl (>= 5.10.1-19), perlapi-5.10.1, libc6 (>= 2.1.3)
Description: An XS implementation of the Levenshtein edit distance
Text::LevenshteinXS implements the Levenshtein edit distance in a XS way; this
should be much faster than the pure Perl implementation.
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: <http://www.merriampark.com/ld.htm>
To UNSUBSCRIBE, email to debian-devel-REQUEST@lists.debian.org
with a subject of "unsubscribe". Trouble? Contact email@example.com