| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evdy (0) - 7 freq evry (1) - 12 freq eddy (1) - 2 freq endy (1) - 8 freq evy (1) - 1 freq emdy (1) - 4 freq ev'dy (1) - 1 freq elxy (2) - 1 freq eld (2) - 30 freq esd (2) - 1 freq vdcy (2) - 1 freq teddy (2) - 16 freq vd (2) - 2 freq cvda (2) - 1 freq bevvy (2) - 20 freq ely (2) - 1 freq eery (2) - 2 freq peedy (2) - 121 freq widy (2) - 6 freq ezd (2) - 1 freq ev (2) - 3 freq rody (2) - 1 freq neddy (2) - 1 freq dvd' (2) - 1 freq edm (2) - 1 freq |
evdy (0) - 7 freq ev'dy (2) - 1 freq vd (2) - 2 freq ovd (2) - 3 freq evade (2) - 2 freq emdy (2) - 4 freq eddy (2) - 2 freq evy (2) - 1 freq endy (2) - 8 freq evry (2) - 12 freq evie (3) - 8 freq eeday (3) - 1 freq even (3) - 2669 freq revd (3) - 2 freq eviry (3) - 1 freq vada (3) - 1 freq reedy (3) - 1 freq addy (3) - 6 freq heedy (3) - 3 freq ridy (3) - 3 freq edi (3) - 1 freq ledy (3) - 1 freq every (3) - 822 freq hvd (3) - 1 freq dvd (3) - 11 freq |
SoundEx code - E130 evyte - 2 freq evade - 2 freq e-boat - 2 freq eft - 3 freq ebbit - 1 freq effete - 4 freq ev'dy - 1 freq evite - 12 freq eveit - 3 freq evdy - 7 freq ept - 1 freq ebbhid - 1 freq efty' - 1 freq epty - 1 freq |
MetaPhone code - EFT eight - 69 freq eaught - 1 freq evyte - 2 freq evade - 2 freq eft - 3 freq eeight - 1 freq eighty - 13 freq effete - 4 freq ev'dy - 1 freq eyght - 4 freq evite - 12 freq eveit - 3 freq evdy - 7 freq €œeight - 1 freq €˜eighty - 1 freq efty' - 1 freq |
EVDY |
| Time to execute Levenshtein function - 0.200577 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.349547 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.027571 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.037823 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.000888 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. |