| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uth (0) - 1 freq 'th (1) - 1 freq uyh (1) - 1 freq fth (1) - 2 freq th (1) - 2479 freq utq (1) - 2 freq wth (1) - 1 freq sth (1) - 1 freq ith (1) - 2 freq utb (1) - 1 freq utha (1) - 1 freq mth (1) - 1 freq uzh (1) - 2 freq ut (1) - 9 freq utj (1) - 1 freq utd (1) - 11 freq ruth (1) - 145 freq tth (1) - 1 freq ugh (1) - 12 freq uh (1) - 9 freq eth (1) - 8 freq utv (1) - 1 freq uch (1) - 3 freq thi (2) - 2576 freq couth (2) - 1 freq |
uth (0) - 1 freq utha (1) - 1 freq th (1) - 2479 freq eth (1) - 8 freq ith (1) - 2 freq tha (2) - 6295 freq ithe (2) - 14 freq eith (2) - 26 freq oath (2) - 13 freq the (2) - 157218 freq tih (2) - 8 freq tah (2) - 2 freq aith (2) - 23 freq thu (2) - 23 freq toh (2) - 4 freq youth (2) - 130 freq thy (2) - 97 freq teh (2) - 1 freq tho (2) - 1083 freq yuith (2) - 1 freq thi (2) - 2576 freq atho (2) - 3 freq othe (2) - 4 freq eeth (2) - 1 freq ut (2) - 9 freq |
SoundEx code - U300 ut - 9 freq uid - 1 freq ¸'ut - 1 freq uth - 1 freq ud - 4 freq utha - 1 freq uydh - 1 freq utd - 11 freq uydo - 1 freq |
MetaPhone code - U0 uth - 1 freq utha - 1 freq |
UTH |
| Time to execute Levenshtein function - 0.238733 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.330526 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.029501 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037820 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000840 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |