- Levenshtein distance : if the pattern is coil, foil differs by one substitution, coils by one insertion, oil by one deletion, and foal by two substitutions.
- Damerau–Levenshtein distance : Like Levenshtein but including transpositions among its allowable operations.
- Jaro–Winkler distance : designed and best suited for short strings such as person names.
- Smith–Waterman algorithm : performs local sequence alignment for determining similar regions between two strings, instead of looking at the total sequence.
- Needleman–Wunsch algorithm : divides a large sequence into a series of smaller problems and uses the solutions to the smaller problems to reconstruct a solution to the larger problem.
- Soundex : a phonetic algorithm for indexing names by sound, as pronounced in English.
- Metaphone : improves on Soundex by using variations and inconsistencies in English spelling and pronunciation.
Approximate string matching cheat sheet
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment