| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eittand (0) - 1 freq sittand (1) - 1 freq gittan (2) - 30 freq fittan (2) - 1 freq syttand (2) - 1 freq sittan (2) - 32 freq eitan (2) - 1 freq rittan (2) - 2 freq wittans (2) - 2 freq pittan (2) - 13 freq dittan (2) - 1 freq hintend (3) - 1 freq gettan (3) - 39 freq kitted (3) - 10 freq tiptaed (3) - 3 freq €œstand (3) - 1 freq sittin (3) - 721 freq titans (3) - 1 freq ettlan (3) - 1 freq tittin (3) - 2 freq visand (3) - 1 freq hertland (3) - 3 freq tand (3) - 1 freq eyland (3) - 2 freq expand (3) - 9 freq |
eittand (0) - 1 freq sittand (2) - 1 freq syttand (3) - 1 freq attend (3) - 36 freq ettld (4) - 1 freq intend (4) - 10 freq tland (4) - 3 freq ettin (4) - 13 freq attained (4) - 1 freq outland (4) - 2 freq extend (4) - 9 freq ootland (4) - 5 freq aittin (4) - 1 freq ttands (4) - 1 freq titan (4) - 5 freq attuned (4) - 2 freq taand (4) - 1 freq maitand (4) - 1 freq ettled (4) - 75 freq etten (4) - 35 freq tand (4) - 1 freq wittans (4) - 2 freq pittan (4) - 13 freq dittan (4) - 1 freq rittan (4) - 2 freq |
SoundEx code - E353 eident - 44 freq eydent - 17 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 - ETNT eident - 44 freq eydent - 17 freq etnty - 1 freq eittand - 1 freq |
EITTAND |
| Time to execute Levenshtein function - 0.227973 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.364149 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.027073 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.036797 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.000824 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. |