Approximate string matching
Finding strings that approximately match a pattern
Approximate string matching
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.
Read on Wikipedia · Image Ricordisamoa, GPL
Open boosters, collect cards and trade them. Free to play.
Play for free