Search results for "module:Text::WagnerFischer"
Text::WagnerFischer - An implementation of the Wagner-Fischer edit distance
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::WagnerFischer::Amharic - The Wagner-Fischer Algorithm for Amharic.
This module implements the Wagner-Fischer edit distance algorithm for Ethiopic script under Amharic Amharic character classes. The edit distance is a measure of the degree of proximity between two strings, based on "edits". Each type of edit is given...
DYACOB/Text-WagnerFischer-Amharic-0.01 - 14 Apr 2003 02:27:48 UTC
Text::WagnerFischer::Armenian - a variation on Text::WagnerFischer for Armenian-language strings
This module implements the Wagner-Fischer distance algorithm modified for Armenian strings. The Armenian language has a number of single-letter prefixes and suffixes which, while not changing the basic meaning of the word, function as definite articl...
AURUM/Text-WagnerFischer-Armenian-0.04 - 09 Feb 2015 17:57:29 UTC
Text::Brew - An implementation of the Brew edit distance
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::JaroWinkler - An implementation of the Jaro-Winkler distance
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
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.15 - 16 Apr 2022 11:07:53 UTC
Text::LevenshteinXS - An XS implementation of the Levenshtein edit distance
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
MusicRoom::Text::Nearest - Select the closest matching names
When handling music tags you often find that variations in spelling and interpretation make it difficult to identify matchs. For example are these two tracks the same? The Sugarhill Gang - Rapper's Delight (reentry) Sugar Hill Gang - The Rappers Deli...
SJHAWTIN/MusicRoom-0.40 - 30 Dec 2009 22:07:39 UTC
Text::TEI::Collate::Lang::Greek - (Classical) Armenian language module for Text::TEI::Collate
This module is an extension of Text::TEI::Collate::Lang for the Greek language. At this point it is really just a placeholder for later use. Also see documentation for Text::TEI::Collate::Lang....
AURUM/Text-TEI-Collate-2.1 - 20 Oct 2011 00:42:43 UTC
Text::TEI::Collate::Lang::Armenian - (Classical) Armenian language module for Text::TEI::Collate
This module is an extension of Text::TEI::Collate::Lang for the Armenian language. It also has some data hashes of orthographic and spelling equivalence, which might be used for real at some point. Also see documentation for Text::TEI::Collate::Lang....
AURUM/Text-TEI-Collate-2.1 - 20 Oct 2011 00:42:43 UTC