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::Levenshtein::XS - Calculate edit distance based on insertion, deletion, and substitution River stage one • 6 direct dependents • 7 total dependents

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('ⓕⓞⓤⓡ',...

UGEXE/Text-Levenshtein-XS-0.503 - 27 Jan 2016 21:08:46 GMT

Text::Levenshtein::Edlib - XS edit distance and optimal alignment path calculation River stage one • 1 direct dependent • 1 total dependent

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

MGV/Text-Levenshtein-Edlib-0.001001 - 11 Mar 2017 22:38:28 GMT

Text::Levenshtein::Damerau - Damerau Levenshtein edit distance. River stage two • 3 direct dependents • 14 total dependents

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

UGEXE/Text-Levenshtein-Damerau-0.41 - 15 Jun 2013 02:59:46 GMT

Text::Levenshtein::Flexible - XS Levenshtein distance calculation with bounds and costs River stage one • 2 direct dependents • 2 total dependents

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

MBETHKE/Text-Levenshtein-Flexible-0.09 - 07 Jun 2014 18:43:40 GMT

PERLANCAR::Text::Levenshtein - Calculate Levenshtein edit distance River stage one • 1 direct dependent • 1 total dependent

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

PERLANCAR/PERLANCAR-Text-Levenshtein-0.02 - 20 Sep 2015 15:22:11 GMT

Text::Levenshtein::Damerau::XS - XS Damerau Levenshtein edit distance. River stage one • 2 direct dependents • 2 total dependents

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('ⓕⓞⓤⓡ','ⓕⓤⓞⓡ...

UGEXE/Text-Levenshtein-Damerau-XS-3.2 - 10 Feb 2017 19:31:23 GMT

Text::Levenshtein::Damerau::PP - Pure Perl Damerau Levenshtein edit distance. River stage two • 3 direct dependents • 14 total dependents

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

UGEXE/Text-Levenshtein-Damerau-0.41 - 15 Jun 2013 02:59:46 GMT

Lingua::EN::SimilarNames::Levenshtein - Compare people first and last names. River stage zero No dependents

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

MATEU/Lingua-EN-SimilarNames-Levenshtein-0.10 - 24 Aug 2011 20:59:17 GMT

9 results (0.017 seconds)