| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eediomatic (0) - 9 freq eidiomatic (1) - 1 freq idiomatic (2) - 3 freq eediotic (2) - 4 freq eediom-rich (3) - 1 freq idomatic (3) - 1 freq enigmatic (3) - 7 freq dramatic (4) - 28 freq diplomatic (4) - 6 freq eediom (4) - 15 freq automatic (4) - 11 freq eemitatin (4) - 1 freq meditatin (4) - 4 freq dedicatit (4) - 21 freq eddicatin (4) - 1 freq dedicatin (4) - 2 freq eediots (4) - 1 freq mediatit (4) - 1 freq ceenematic (4) - 1 freq eddicatit (4) - 9 freq prismatic (4) - 1 freq aromatic (4) - 2 freq climatic (4) - 1 freq estimatit (4) - 2 freq somatic (4) - 1 freq |
eediomatic (0) - 9 freq eidiomatic (1) - 1 freq idiomatic (2) - 3 freq idomatic (3) - 1 freq eediotic (3) - 4 freq automatic (5) - 11 freq aromatic (5) - 2 freq somatic (5) - 1 freq demotic (5) - 5 freq enigmatic (5) - 7 freq dramatic (5) - 28 freq otamatic (6) - 1 freq undemotic (6) - 1 freq climatic (6) - 1 freq eediot (6) - 5 freq semitic (6) - 1 freq diabetic (6) - 2 freq adriatic (6) - 2 freq eedioms (6) - 8 freq domestic (6) - 20 freq eediom-rich (6) - 1 freq dominic (6) - 3 freq eediom (6) - 15 freq eediots (6) - 1 freq diplomatic (6) - 6 freq |
SoundEx code - E353 eident - 47 freq eydent - 20 freq eydently - 22 freq eidently - 16 freq eton-eddicated - 1 freq etnty - 1 freq eetimtation - 2 freq eediomatic - 9 freq eydentlie - 17 freq ehdentiteh - 1 freq eidenthie - 1 freq eidentlie - 3 freq eydentrie - 1 freq eittand - 1 freq eidiomatic - 1 freq edentulous - 1 freq edewanttimisseet - 1 freq edindogcathome - 2 freq |
MetaPhone code - ETMTK eediomatic - 9 freq eidiomatic - 1 freq |
EEDIOMATIC |
| Time to execute Levenshtein function - 0.278828 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.506139 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.037473 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.050316 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.001317 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. |