| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weill-cordit (0) - 1 freq weill-airtit (3) - 1 freq weill-airmit (3) - 1 freq weill-wurdie (3) - 1 freq weill-roundit (3) - 1 freq weill-suitit (4) - 2 freq weill-muntit (4) - 1 freq weel-forrit (4) - 6 freq weill-composit (4) - 1 freq weill-wappit (4) - 1 freq ill-yokit (5) - 1 freq haill-heidit (5) - 2 freq weirdit (5) - 5 freq weel-tendit (5) - 1 freq weill-kent (5) - 20 freq weill-fed (5) - 1 freq weill-cumed (5) - 1 freq well-traint (5) - 1 freq weill-thocht (5) - 1 freq weel-needit (5) - 1 freq recordit (5) - 27 freq ill-kindit (5) - 1 freq well-worn (5) - 1 freq weel-armit (5) - 1 freq weel-foondit (5) - 2 freq |
weill-cordit (0) - 1 freq weill-wurdie (5) - 1 freq weill-roundit (5) - 1 freq weill-airmit (5) - 1 freq weill-airtit (5) - 1 freq weill-faurd (7) - 1 freq well-traint (7) - 1 freq weill-wappit (7) - 1 freq weill-cumed (7) - 1 freq weill-composit (7) - 1 freq weill-muntit (7) - 1 freq weill-suitit (7) - 2 freq weel-forrit (7) - 6 freq weill-wrocht (8) - 2 freq haill-hertit (8) - 1 freq ill-hertit (8) - 7 freq ill-kyndit (8) - 3 freq well-formed (8) - 1 freq weel-cared (8) - 1 freq weel-widdit (8) - 1 freq mell-heidit (8) - 1 freq weel-ordert (8) - 1 freq weill-adaptit (8) - 1 freq weill-made (8) - 2 freq weel-foundit (8) - 2 freq |
SoundEx code - W426 walker - 25 freq weel-wishers - 3 freq weel-wushers - 1 freq wheelchair - 14 freq walker's - 5 freq waalker's - 2 freq walkers - 18 freq walkers' - 1 freq weel-creeshed - 1 freq weel-cared - 1 freq wheelcheer - 4 freq weill-cordit - 1 freq willsher - 1 freq weill-graithit - 1 freq weel-groomed - 1 freq wheelchairs - 1 freq wheelchyre - 3 freq weel-grundit - 1 freq walkcork - 1 freq wlsqqraasf - 1 freq wilshire - 2 freq walkers - 1 freq |
MetaPhone code - WLKRTT weill-cordit - 1 freq |
WEILL-CORDIT |
| Time to execute Levenshtein function - 0.210047 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.399470 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.028985 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.045722 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.001015 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. |