perl-Text-Levenshtein
Calculate the Levenshtein edit distance between two strings
This module implements the Levenshtein edit distance, which measures the difference between two strings, in terms of the _edit distance_. 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. To learn more about the Levenshtein metric, have a look at the at http://en.wikipedia.org/wiki/Levenshtein_distance.
Artistic-1.0 OR GPL-1.0-or-latercloud_download Downloads
To download packages, you need to log in and have a valid subscription.
Please select a product to see the available package versions:
Loading...
Loading package downloads...