| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evdy (0) - 7 freq ev'dy (1) - 1 freq eddy (1) - 1 freq evry (1) - 12 freq endy (1) - 8 freq evy (1) - 1 freq emdy (1) - 4 freq teady (2) - 1 freq hevvy (2) - 1 freq ivry (2) - 124 freq ecky (2) - 9 freq vdr (2) - 1 freq ed (2) - 53 freq ady (2) - 2 freq levoy (2) - 1 freq ekd (2) - 1 freq ende (2) - 3 freq edj (2) - 1 freq edr (2) - 1 freq espy (2) - 2 freq €™dy (2) - 23 freq etsy (2) - 1 freq even (2) - 2579 freq vwdy (2) - 1 freq eid (2) - 4 freq |
evdy (0) - 7 freq evade (2) - 2 freq ovd (2) - 3 freq evy (2) - 1 freq vd (2) - 2 freq emdy (2) - 4 freq ev'dy (2) - 1 freq eddy (2) - 1 freq evry (2) - 12 freq endy (2) - 8 freq ovey (3) - 1 freq evn (3) - 1 freq edi (3) - 1 freq evir (3) - 4 freq reedy (3) - 1 freq bidy (3) - 1 freq mvd (3) - 1 freq eld (3) - 30 freq needy (3) - 7 freq andy (3) - 151 freq ead (3) - 1 freq eeday (3) - 1 freq widy (3) - 6 freq kedy (3) - 1 freq ivy (3) - 7 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 - 66 freq eaught - 1 freq evyte - 2 freq evade - 2 freq eft - 3 freq eeight - 1 freq effete - 4 freq eighty - 12 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.177878 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.319228 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.027314 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.037102 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.000948 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. |