| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evz (0) - 1 freq erz (1) - 3 freq ehz (1) - 1 freq ez (1) - 5 freq evi (1) - 1 freq vz (1) - 4 freq eve (1) - 80 freq emz (1) - 4 freq eva (1) - 7 freq evy (1) - 1 freq eez (1) - 105 freq ecz (1) - 1 freq ev (1) - 3 freq evn (1) - 1 freq evb (1) - 1 freq vp (2) - 4 freq leaz (2) - 1 freq tvj (2) - 2 freq avs (2) - 1 freq mve (2) - 1 freq fvp (2) - 1 freq eq (2) - 1 freq yaz (2) - 1 freq jz (2) - 1 freq efh (2) - 1 freq |
evz (0) - 1 freq vz (1) - 4 freq evn (2) - 1 freq ecz (2) - 1 freq ev (2) - 3 freq evb (2) - 1 freq vzi (2) - 1 freq vzu (2) - 1 freq eez (2) - 105 freq viz (2) - 6 freq erz (2) - 3 freq ehz (2) - 1 freq evy (2) - 1 freq evi (2) - 1 freq ez (2) - 5 freq emz (2) - 4 freq eva (2) - 7 freq eve (2) - 80 freq sez (3) - 30 freq vm (3) - 11 freq v (3) - 266 freq mz (3) - 4 freq kz (3) - 4 freq dz (3) - 3 freq evie (3) - 8 freq |
SoundEx code - E120 eves - 1 freq effeck - 36 freq epic - 20 freq evoke - 3 freq eevees - 1 freq effecks - 21 freq ebc - 1 freq ee-baws - 1 freq effie's - 1 freq ebbs - 5 freq effek - 4 freq eyebas - 1 freq effeks - 1 freq eaves - 2 freq evacuee - 1 freq ep's - 2 freq efuc - 1 freq evfejh - 1 freq ebbes - 1 freq evoc - 1 freq eifgw - 1 freq efj - 1 freq evz - 1 freq ebka - 1 freq eeweeehvoq - 1 freq ebswe - 1 freq epusgw - 1 freq eiwahhwyfx - 1 freq efc - 1 freq effies - 1 freq ebg - 1 freq evoygu - 1 freq |
MetaPhone code - EFS eves - 1 freq eevees - 1 freq effie's - 1 freq eaves - 2 freq evz - 1 freq effies - 1 freq |
EVZ |
| Time to execute Levenshtein function - 0.185720 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.351687 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.030120 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.037193 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.000952 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. |