Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Approximate string matching
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding <a href="/facts/String_(computing)/4ChJu5WS">strings</a> that match a <a href="/facts/Pattern/mzD7uLQa">pattern</a> approximately (rather than exactly). The problem of approximate string matching is typically divided into two sub-problems: finding approximate <a href="/facts/Substring/dM5Rqg6X">substring</a> matches inside a given string and finding dictionary strings that match the pattern approximately. </p>