| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utir (0) - 1 freq uthir (1) - 1 freq stir (1) - 19 freq tir (1) - 4 freq atil (2) - 17 freq rair (2) - 30 freq æir (2) - 1 freq urie (2) - 1 freq iti (2) - 1 freq uner (2) - 2 freq astir (2) - 1 freq 'thir (2) - 2 freq itis (2) - 1 freq sir (2) - 356 freq tyr (2) - 1 freq tib (2) - 10 freq tire (2) - 12 freq ui (2) - 6 freq hair (2) - 867 freq ktid (2) - 1 freq dustir (2) - 1 freq keir (2) - 9 freq €˜ir (2) - 1 freq tirn (2) - 35 freq sti (2) - 1 freq |
utir (0) - 1 freq tir (1) - 4 freq tire (2) - 12 freq teir (2) - 10 freq ter (2) - 6 freq tier (2) - 36 freq tor (2) - 4 freq ytr (2) - 1 freq atr (2) - 1 freq outer (2) - 4 freq tur (2) - 2 freq etr (2) - 1 freq tyr (2) - 1 freq tar (2) - 26 freq stir (2) - 19 freq tr (2) - 8 freq uthir (2) - 1 freq tirr (3) - 5 freq suir (3) - 11 freq tear (3) - 100 freq 'yir (3) - 4 freq letir (3) - 2 freq yugir (3) - 2 freq upr (3) - 2 freq fair (3) - 1516 freq |
SoundEx code - U360 utter - 62 freq udr - 1 freq udhr - 1 freq uther - 9 freq uthur - 1 freq uthir - 1 freq utir - 1 freq udder - 1 freq |
MetaPhone code - UTR utter - 62 freq udr - 1 freq udhr - 1 freq utir - 1 freq udder - 1 freq |
UTIR |
| Time to execute Levenshtein function - 0.203222 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.561769 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.030841 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.080872 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.001090 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. |