| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uthir (0) - 1 freq 'thir (1) - 2 freq thir (1) - 1575 freq vthir (1) - 2 freq ithir (1) - 35 freq uther (1) - 9 freq othir (1) - 1 freq outhir (1) - 1 freq utir (1) - 1 freq uthur (1) - 1 freq eethir (2) - 10 freq thirl (2) - 3 freq ether (2) - 27 freq thiv (2) - 19 freq thid (2) - 1 freq other (2) - 579 freq €™hir (2) - 1 freq steir (2) - 22 freq 'ther (2) - 1 freq thir' (2) - 1 freq thig (2) - 3 freq withir (2) - 3 freq thur (2) - 373 freq unther (2) - 9 freq thyr (2) - 6 freq |
uthir (0) - 1 freq othir (1) - 1 freq uthur (1) - 1 freq uther (1) - 9 freq outhir (1) - 1 freq ithir (1) - 35 freq thir (1) - 1575 freq thur (2) - 373 freq thor (2) - 20 freq thiry (2) - 1 freq thyr (2) - 6 freq their (2) - 5115 freq thair (2) - 1955 freq ther (2) - 111 freq ither (2) - 3074 freq thier (2) - 3 freq eethir (2) - 10 freq ather (2) - 3 freq utir (2) - 1 freq vthir (2) - 2 freq 'thir (2) - 2 freq other (2) - 579 freq ether (2) - 27 freq author (2) - 37 freq thar (2) - 103 freq |
SoundEx code - U360 utter - 63 freq udr - 1 freq udhr - 1 freq uther - 9 freq uthur - 1 freq uthir - 1 freq utir - 1 freq udder - 1 freq |
MetaPhone code - U0R uther - 9 freq uthur - 1 freq uthir - 1 freq |
UTHIR |
| Time to execute Levenshtein function - 0.205251 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.383123 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.027945 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.038106 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.000888 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. |