| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yuletide (0) - 12 freq yule-tide (1) - 1 freq yuiltide (2) - 1 freq suretie (3) - 2 freq yolewife (3) - 1 freq quietude (3) - 1 freq ful-time (3) - 2 freq auldtime (3) - 2 freq quietie (3) - 1 freq betide (3) - 4 freq oul-time (3) - 2 freq velvetie (4) - 1 freq ruled (4) - 25 freq volatile (4) - 3 freq weetie (4) - 1 freq teletype (4) - 1 freq aplentie (4) - 2 freq lifetime (4) - 52 freq huttie (4) - 1 freq purelie (4) - 1 freq buttie (4) - 2 freq delete (4) - 9 freq dulesome (4) - 18 freq quiethke (4) - 1 freq polatie (4) - 1 freq |
yuletide (0) - 12 freq yuiltide (2) - 1 freq yule-tide (2) - 1 freq quietude (4) - 1 freq betide (4) - 4 freq ltd (5) - 8 freq beleted (5) - 1 freq deleted (5) - 4 freq fetid (5) - 3 freq letir (5) - 2 freq solitude (5) - 9 freq aulde (5) - 1 freq tide (5) - 118 freq suitid (5) - 3 freq etude (5) - 1 freq leid (5) - 1536 freq lede (5) - 9 freq leided (5) - 1 freq untidy (5) - 1 freq elide (5) - 1 freq stide (5) - 2 freq quieted (5) - 1 freq leeted (5) - 1 freq yaldie (5) - 3 freq auldtime (5) - 2 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 |
YULETIDE |
| Time to execute Levenshtein function - 0.233518 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.373872 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.027649 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.039485 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. |