Text::Levenshtein - calculate the Levenshtein edit distance between two strings River stage one • 7 direct dependents • 9 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.14 - 24 Mar 2021 23:21:29 UTC

Text::Levenshtein::XS - Calculate edit distance based on insertion, deletion, and substitution River stage one • 4 direct dependents • 5 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::BV - Bit Vector (BV) implementation of the Levenshtein Algorithm River stage zero No dependents

CONSTRUCTOR new() Creates a new object which maintains internal storage areas for the SES computation. Use one of these per concurrent SES() call. METHODS SES(\@a,\@b) Finds a Shortest Edit Script (SES), taking two arrayrefs as method arguments. It r...

WOLLMERS/Text-Levenshtein-BV-0.05 - 06 Aug 2020 13:44:41 UTC

Text::Levenshtein::Edlib - XS edit distance and optimal alignment path calculation River stage zero No dependents

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 UTC

Text::Levenshtein::Damerau - Damerau Levenshtein edit distance. River stage two • 2 direct dependents • 13 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 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

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 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::Levenshtein::Damerau::PP - Pure Perl Damerau Levenshtein edit distance. River stage two • 2 direct dependents • 13 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 UTC

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::Brew - An implementation of the Brew edit distance River stage two • 2 direct dependents • 23 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 UTC

Text::Median - Perl extension for determining the set median of a set of strings River stage zero No dependents

The median of a set of strings is defined as the string that minimizes the sum of all distances between that string and all other strings within the set. The true median is not necessarily a member of the set of strings. It as been shown that finding...

LMETCALF/Text-Median-0.02 - 27 Nov 2011 16:57:42 UTC

Text::Distill - Quick texts compare, plagiarism and common parts detection River stage zero No dependents

GRIBUSER/Text-Distill-0.5 - 09 Oct 2020 11:13:44 UTC

Text::Fuzzy::PP - partial or fuzzy string matching using edit distances (Pure Perl) River stage one • 1 direct dependent • 1 total dependent

This module is a drop in, pure perl, substitute for Text::Fuzzy. All documentation is taken directly from Text::Fuzzy. This module calculates the Levenshtein edit distance between words, and does edit-distance-based searching of arrays and files to f...

UGEXE/Text-Fuzzy-PP-0.01 - 04 Apr 2013 02:58:01 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::WagnerFischer - An implementation of the Wagner-Fischer edit distance River stage one • 3 direct dependents • 3 total dependents

This module implements the Wagner-Fischer dynamic programming technique, used here to calculate the edit distance of two strings. The edit distance is a measure of the degree of proximity between two strings, based on "edits": the operations of subst...

DAVIDEBE/Text-WagnerFischer-0.04 - 17 Dec 2005 17:22:53 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::Tradition::Analysis - functions for stemma analysis of a tradition River stage zero No dependents

Text::Tradition is a library for representation and analysis of collated texts, particularly medieval ones. Where the Collation is the central feature of a Tradition, it may also have one or more stemmata associated with it, and these stemmata may be...

AURUM/Text-Tradition-Analysis-2.0.4 - 17 Apr 2016 15:30:30 UTC
18 results (0.034 seconds)