Approximate string matching
Finding strings that approximately match a pattern / From Wikipedia, the free encyclopedia
In computer science, 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.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/6/69/Did_you_mean_andr%C3%A9_emotions.png/640px-Did_you_mean_andr%C3%A9_emotions.png)