Back Wasige stringpassing Afrikaans مطابقة تقريبية للسلاسل Arabic Unscharfe Suche German الگوریتم تطابق رشتهها Persian Recherche approximative French Pencarian string samar ID Приближенное соответствие строк Russian Приближно поклапање ниске Serbian Наближена відповідність рядків Ukrainian 字符串近似匹配 Chinese
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.