| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yuiltide (0) - 1 freq yuletide (2) - 12 freq guiltie (2) - 4 freq quiltin (3) - 1 freq quietude (3) - 1 freq quietie (3) - 1 freq suitid (3) - 3 freq cuitie (3) - 1 freq yule-tide (3) - 1 freq tuilzie (3) - 5 freq quilted (3) - 1 freq yuile (3) - 1 freq tuilyie (3) - 2 freq juistice (3) - 11 freq suicide (3) - 10 freq yuikie (3) - 1 freq uillie (3) - 1 freq huilie (3) - 2 freq 'kiltie (3) - 1 freq kiltie (3) - 5 freq tuilie (3) - 1 freq quitie (3) - 2 freq subtie (4) - 1 freq stiltit (4) - 1 freq willile (4) - 1 freq |
yuiltide (0) - 1 freq yuletide (2) - 12 freq quietude (4) - 1 freq suitid (4) - 3 freq quilted (4) - 1 freq guiltie (4) - 4 freq yule-tide (4) - 1 freq kilted (5) - 6 freq tide (5) - 118 freq ltd (5) - 8 freq elide (5) - 1 freq stide (5) - 2 freq liftid (5) - 1 freq ruited (5) - 4 freq ultima (5) - 4 freq littie (5) - 1 freq betide (5) - 4 freq untidy (5) - 1 freq aulde (5) - 1 freq suited (5) - 16 freq tilted (5) - 5 freq quieted (5) - 1 freq quited (5) - 1 freq elted (5) - 1 freq yaldie (5) - 3 freq |
SoundEx code - Y433 yuletide - 12 freq yella-heidit - 1 freq yielded - 2 freq yeldadee - 1 freq yule-tide - 1 freq yuiltide - 1 freq |
MetaPhone code - YLTT yuletide - 12 freq yielded - 2 freq yeldadee - 1 freq yule-tide - 1 freq yuiltide - 1 freq |
YUILTIDE |
| Time to execute Levenshtein function - 0.403530 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.717539 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.071480 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.038316 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.000882 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. |