Approximate String Matching System

An Approximate String Matching System is a string matching system that can solve an approximate string matching task by implementing an approximate string matching algorithm.

• AKA: Approximate String Matcher.
  • …
• Example(s):
  • SecondString System.
  • 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
• Counter-Example(s):
  • an Exact String Matching System.
• See: Sequence Alignment System.

---