Approximate String Matching Task

From GM-RKB
(Redirected from Approximate String Matching)
Jump to: navigation, search

An approximate string matching task is a string matching task that is a similarity search task.



References

2011

  • (Wikipedia, 2011) ⇒ http://en.wikipedia.org/wiki/Approximate_string_matching
    • In computing, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match a pattern approximately (rather than exactly). The problem of approximate string matching is typically divided into two sub-problems: finding approximate substring matches inside a given string and finding dictionary strings that match the pattern approximately.

2002

2001

1995

  • (Zobel & Dart, 1995) ⇒ J. Zobel, P. Dart. (1995). “Finding Approximate Matches in Large Lexicons.” In: Software-Practice & Experience 25(3), pp 331–345.

1985

  • (Ukkonen, 1985) ⇒ E. Ukkonen. (1985). “Algorithms for Approximate String Matching.” In: Information and Control, 64.

1974