Text::Brew - An implementation of the Brew edit distance River stage two • 4 direct dependents • 37 total dependents

This module implements the Brew edit distance that is very close to the dynamic programming technique used for the Wagner-Fischer (and so for the Levenshtein) edit distance. Please look at the module references below. For more information about the B...

KCIVEY/Text-Brew-0.02 - 02 Apr 2005 15:41:46 GMT

Text::Levenshtein - calculate the Levenshtein edit distance between two strings River stage two • 9 direct dependents • 11 total dependents

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 i...

NEILB/Text-Levenshtein-0.13 - 11 Aug 2015 21:54:36 GMT

Text::LevenshteinXS - An XS implementation of the Levenshtein edit distance River stage two • 14 direct dependents • 20 total dependents

This module implements the Levenshtein edit distance in a XS way. 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 tra...

JGOLDBERG/Text-LevenshteinXS-0.03 - 01 Jul 2004 01:45:48 GMT

3 results (0.027 seconds)