String::Levenshtein

String::Levenshtein computes the Levenshtein distance between two strings. The Levenshtein distance is defined as the minimum number of characters that must be added, removed, or changed in order to transform one string into another.

The Levenshtein distance is also called the edit distance.

Source

• Levenshtein.pm
• Levenshtein.xs
• distance.c

Documentation

Levenshtein.pod

Distribution

String-Levenshtein-1.02.tar.gz