String::Similarity - calculate the similarity of two strings River stage one • 8 direct dependents • 8 total dependents

POD ERRORS Hey! The above document had some coding errors, which are explained below: Around line 3: =over is the last thing in the document?!...

MLEHMANN/String-Similarity-1.04 - 03 Jul 2009 13:48:31 UTC

lib/String/Similarity/ River stage zero No dependents

LEOCHARRE/String-Similarity-Group-1.16 - 20 Aug 2009 14:59:02 UTC

String::Simrank - Rapid comparisons of many strings for k-mer similarity. River stage zero No dependents

The String::Simrank module allows rapid searches for similarity between query strings and a database of strings. This module is maintained by molecular biologists who use it for searching for similarities among strings representing contiguous DNA or ...

SHURIKO/String-Simrank-0.079 - 27 Jul 2010 19:15:12 UTC

String::Trigram - Find similar strings by trigram (or 1, 2, 4, etc.-gram) method River stage one • 1 direct dependent • 1 total dependent

This module computes the similarity of two strings based on the trigram method. This consists of splitting some string into triples of characters and comparing those to the trigrams of some other string. For example the string kangaroo has the trigra...

TAREKA/String-Trigram-0.12 - 22 Dec 2013 09:50:01 UTC

String::Similex - gives a code to compare similar "visual" strings River stage zero No dependents

The similex code is used to compare strings that are visually equivalent, character sequences that resemble each other....

BIAFRA/String-Similex-0.01 - 17 Feb 2017 12:00:01 UTC

String::Approx - Perl extension for approximate matching (fuzzy matching) River stage one • 7 direct dependents • 8 total dependents

String::Approx lets you match and substitute strings approximately. With this you can emulate errors: typing errorrs, speling errors, closely related vocabularies (colour color), genetic mutations (GAG ACT), abbreviations (McScot, MacScot). NOTE: Str...

JHI/String-Approx-3.28 - 16 Apr 2017 08:52:13 UTC

String::Cluster::Hobohm - Cluster strings using the Hobohm algorithm River stage zero No dependents

String::Cluster::Hobohm implements the Hobohm clustering algorithm [1], originally devised to reduce redundancy of biological sequence data sets. As a clustering algorithm, it takes a set of sequences, and returns them grouped by similarity. The latt...

BRUNOV/String-Cluster-Hobohm-0.141020 - 12 Apr 2014 18:15:49 UTC

String::KeyboardDistance - String Comparison Algorithm River stage zero No dependents

This module implmements a version of keyboard distance for fuzzy string matching. Keyboard distance is a measure of the physical distance between two keys on a keyboard. For example, 'g' has a distance of 1 from the keys 'r', 't', 'y', 'f', 'h', 'v',...

KRBURTON/String-KeyboardDistance-1.01 - 09 May 2002 16:39:09 UTC

String::KeyboardDistanceXS - String Comparison Algorithm River stage zero No dependents

This is an XS implementation of the main qwerty functions for computing the distance and match probabilities from the String::KeyboardDistance module. Please see the documentation for String::KeyboardDistance for more about these functions. Since the...

KRBURTON/String-KeyboardDistanceXS-0.02 - 20 May 2002 16:56:28 UTC
9 results (0.039 seconds)