| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| idledom (0) - 1 freq erledome (3) - 1 freq ileum (3) - 1 freq idiom (3) - 9 freq idle (3) - 27 freq iled (3) - 1 freq kyledoc (3) - 1 freq idlers (3) - 1 freq boredom (3) - 17 freq flaedom (3) - 1 freq idles (3) - 1 freq freedom (3) - 111 freq seldom (3) - 27 freq idleset (3) - 4 freq aisedom (3) - 6 freq aidled (3) - 1 freq toledo (3) - 1 freq fifedom (3) - 1 freq easedom (3) - 4 freq sidled (3) - 2 freq besom (4) - 30 freq becom (4) - 1 freq watedoo (4) - 1 freq gaeldom (4) - 1 freq riled (4) - 9 freq |
idledom (0) - 1 freq erledome (4) - 1 freq seldom (4) - 27 freq aidled (4) - 1 freq flaedom (4) - 1 freq gaeldom (5) - 1 freq dirdum (5) - 20 freq easedom (5) - 4 freq ludm (5) - 1 freq erldome (5) - 2 freq ladym (5) - 2 freq daled (5) - 5 freq doled (5) - 3 freq dulesum (5) - 1 freq dulesome (5) - 18 freq deedledum (5) - 33 freq fifedom (5) - 1 freq sidled (5) - 2 freq toledo (5) - 1 freq idles (5) - 1 freq boredom (5) - 17 freq iled (5) - 1 freq idlers (5) - 1 freq idle (5) - 27 freq idiom (5) - 9 freq |
SoundEx code - I343 idults - 1 freq idledom - 1 freq |
MetaPhone code - ITLTM idledom - 1 freq |
IDLEDOM |
| Time to execute Levenshtein function - 0.279679 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.398272 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.038484 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.053360 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.001177 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. |