Approximate String Matching
/əˈprɑksɪmət strɪŋ ˈmætʃɪŋ/
noun — "finding near matches between strings."
String Metrics
/strɪŋ ˈmɛtrɪks/
noun — "quantitative measures of string similarity or difference."
String Metrics are computational methods used to quantify the similarity, difference, or distance between sequences of characters, commonly referred to as strings. They are central in fields such as natural language processing, text mining, computational biology, and information retrieval. String metrics enable algorithms to rank or cluster strings, detect errors, perform fuzzy matching, or compare sequences for alignment purposes.
Damerau-Levenshtein
/ˌdæməˌraʊ ˌlɛvə(n)ˈʃtaɪn/
noun — "an enhanced string difference metric allowing transpositions."
Levenshtein Distance
/ˌlɛvə(n)ˈʃtaɪn ˈdɪstəns/
noun — "a metric for measuring string differences."