Jump to content

Approximate string matching

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Emj (talk | contribs) at 10:55, 27 December 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The art of finding the closest match, in a dictionary, for a string supplied. Usually the algorithm that does this is given a variable that specifies the biggest number of misspelled characters in the word.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Approximate_string_matching&oldid=32865259"