| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eident (0) - 44 freq wident (1) - 2 freq eydent (1) - 17 freq reident (1) - 2 freq evident (1) - 12 freq trident (2) - 18 freq fient (2) - 6 freq bidet (2) - 1 freq resident (2) - 16 freq heidet (2) - 1 freq rodent (2) - 4 freq eider (2) - 3 freq eidein (2) - 1 freq eidently (2) - 16 freq lisent (2) - 1 freq biden (2) - 9 freq ardent (2) - 2 freq herdent (2) - 1 freq didnt (2) - 3 freq reiden (2) - 1 freq eien (2) - 1 freq einen (2) - 1 freq iden (2) - 2 freq heiden (2) - 1 freq event (2) - 103 freq |
eident (0) - 44 freq eydent (1) - 17 freq wident (2) - 2 freq dent (2) - 4 freq evident (2) - 12 freq reident (2) - 2 freq dunt (3) - 92 freq ladent (3) - 1 freq dont (3) - 76 freq denty (3) - 6 freq event (3) - 103 freq divent (3) - 1 freq aipent (3) - 1 freq mient (3) - 3 freq eidart (3) - 1 freq didnt (3) - 3 freq eidiot (3) - 1 freq eden (3) - 36 freq iden (3) - 2 freq fient (3) - 6 freq rodent (3) - 4 freq dant (3) - 1 freq dint (3) - 10 freq eidently (3) - 16 freq ardent (3) - 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 |
EIDENT |
| Time to execute Levenshtein function - 0.319689 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.560786 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.031976 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.038821 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.000823 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. |