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

Returns the number of edits (insert,delete,substitute) required to turn the source string into the target string. XS implementation (requires a C compiler). Works correctly with utf8. use Text::Levenshtein::XS qw/distance/; use utf8; distance('ⓕⓞⓤⓡ',...

Text::Levenshtein::Edlib is a wrapper around the edlib library that computes Levenshtein edit distance and optimal alignment path for a pair of strings. It does not handle UTF-8 strings, for those Text::Levenshtein::XS can compute edit distance but n...

Returns the true Damerau Levenshtein edit distance of strings with adjacent transpositions. Useful for fuzzy matching, DNA variation metrics, and fraud detection. Defaults to using Pure Perl Text::Levenshtein::Damerau::PP, but has an XS addon Text::L...

Yet another Levenshtein module written in C, but a tad more flexible than the rest. This module uses code from PostgreSQL's levenshtein distance function to provide the following features on top of plain distance calculation as it is done by Levensht...

This module contains the routine "editdist" copied from App::perlbrew, which is copied from Wikipedia article "Levenshtein Distance"....

Returns the true Damerau Levenshtein edit distance of strings with adjacent transpositions. XS implementation (requires a C compiler). Works correctly with utf8. use Text::Levenshtein::Damerau::XS qw/xs_edistance/; use utf8; xs_edistance('ⓕⓞⓤⓡ','ⓕⓤⓞⓡ...

Returns the true Damerau Levenshtein edit distance of strings with adjacent transpositions. Pure Perl implementation. Works correctly with utf8. use Text::Levenshtein::Damerau::PP qw/pp_edistance/; use utf8; pp_edistance('ⓕⓞⓤⓡ','ⓕⓤⓞⓡ'), # prints 1 PO...

Given a list of people objects, find the people whose names are within a specified edit distance....