Text::LevenshteinXS - An XS implementation of the Levenshtein edit distance River stage two • 13 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 UTC

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

Text::Levenshtein::Damerau::XS - XS Damerau Levenshtein edit distance. River stage one • 1 direct dependent • 1 total dependent

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 UTC

Text::JaroWinkler - An implementation of the Jaro-Winkler distance River stage zero No dependents

This module implements the Jaro-Winkler distance. The Jaro-Winkler distance is a measure of similarity between two strings. It is a variant of the Jaro distance metric and mainly used in the area of record linkage (duplicate detection). The higher th...

SCW/Text-JaroWinkler-0.1 - 16 Jan 2009 05:00:37 UTC

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 UTC

Text::EditTranscript - Perl extension for determining the edit transcript between two strings River stage zero No dependents

The edit transcript is a sequence of operations to transform one string into another string. The operations include 'Insertion', 'Deletion', and Substitution. This module creates a string denoting the list of operations to transfer the second string ...

LMETCALF/Text-EditTranscript-0.07 - 16 Oct 2009 14:56:42 UTC

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 UTC

7 results (0.026 seconds)