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).
Welcome to String::Approx 3.0.
This release is a major update from String Approx 2,
of which 2.7 was the last release. See later about the future
of version 2.
The most important change was that the underlying algorithm was
changed completely. Instead of doing everything in Perl using regular
expressions we now do the matching in C using the so-called Manber-Wu
k-differences algorithm shift-ad
This code implements the basic 'bitap' algorithm for approximate
string matching, within "edit distance" (Levenshtein measure). The
edit distance is defined as the total number of insertions, deletions,
and substitutions required to transfrom a string to (possibly a
substring of) another. "sale" is within 1 edit from "salve", "ale",
and "same", and within 2 edits from "fake".
The algorithm was d
Approx(3pm) User Contributed Perl Documentation Approx(3pm)
String::Approx - Perl extension for approximate matching
use String::Approx 'amatch';
print if amatch("foobar");
my @matches = amatch("xyzzy", @inputs);
my @catches = amatch("plugh", ['2'], @inputs);
String::Approx lets you