Approximate String Matching System

From GM-RKB

Revision as of 02:57, 29 April 2012 by Gmelli (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

An Approximate String Matching System is a Computing System that can solve an Approximate String Matching Task by implementing an Approximate String Matching Algorithm.

AKA: Approximate String Matcher.
Example(s):
- http://search.cpan.org/~jhi/String-Approx-3.26/Approx.pm
- http://search.cpan.org/dist/Text-Levenshtein/
- improved levenshtein http://www.perlmonks.org/?node_id=333616
See: Sequence Alignment System.

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Approximate_String_Matching_System&oldid=11446"

Concept