Text-LevenshteinXS
Text-levenshteinxs
https://metacpan.org/release/Text-LevenshteinXS
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.
Download
Categories
Licensing
License
Verified by
Verified on
Notes
License
Verified by
Debian: Florian Schlichting <fsfs@debian.org>
Verified on
24 April 2014
Notes
License: artistic or gpl-1+
Leaders and contributors
| Contact(s) | Role |
|---|---|
| Josh Goldberg | contact |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Debian (Ref) (R) | https://tracker.debian.org/pkg/libtext-levenshteinxs-perl | |
| Perl (Ref) | https://metacpan.org/release/Text-LevenshteinXS |
Software prerequisites
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.