| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eydent (0) - 17 freq eident (1) - 44 freq syden (2) - 1 freq eyven (2) - 8 freq ardent (2) - 2 freq eydence (2) - 1 freq ladent (2) - 1 freq wident (2) - 2 freq entent (2) - 1 freq endet (2) - 42 freq rodent (2) - 4 freq eldest (2) - 18 freq event (2) - 103 freq eccent (2) - 4 freq reident (2) - 2 freq extent (2) - 47 freq evident (2) - 12 freq beyden (2) - 1 freq dent (2) - 4 freq herdent (2) - 1 freq yent (2) - 1 freq eydently (2) - 22 freq peyment (2) - 6 freq eden (2) - 36 freq byde (3) - 62 freq |
eydent (0) - 17 freq eident (1) - 44 freq dent (2) - 4 freq reident (3) - 2 freq denty (3) - 6 freq eden (3) - 36 freq dant (3) - 1 freq yent (3) - 1 freq event (3) - 103 freq evident (3) - 12 freq rodent (3) - 4 freq eydence (3) - 1 freq ardent (3) - 2 freq dunt (3) - 92 freq ladent (3) - 1 freq wident (3) - 2 freq eydently (3) - 22 freq dont (3) - 76 freq dint (3) - 10 freq didnt (4) - 3 freq fent (4) - 11 freq ediot (4) - 1 freq earnt (4) - 10 freq ment (4) - 18 freq ayont (4) - 272 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 |
EYDENT |
| Time to execute Levenshtein function - 0.186093 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.377125 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.027558 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.039010 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.000955 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. |