| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eqvy (0) - 1 freq envy (1) - 25 freq evy (1) - 1 freq eddy (2) - 2 freq hevvy (2) - 1 freq qv (2) - 3 freq euy (2) - 1 freq eisy (2) - 1 freq eev (2) - 5 freq qey (2) - 1 freq espy (2) - 2 freq lavy (2) - 3 freq qcy (2) - 1 freq erey (2) - 1 freq fvy (2) - 1 freq emva (2) - 1 freq eery (2) - 2 freq engy (2) - 2 freq oqy (2) - 1 freq ebvn (2) - 1 freq ermy (2) - 2 freq ecv (2) - 1 freq hqv (2) - 1 freq elxy (2) - 1 freq eqr (2) - 2 freq |
eqvy (0) - 1 freq qvi (2) - 1 freq qv (2) - 3 freq evy (2) - 1 freq envy (2) - 25 freq navy (3) - 45 freq e've (3) - 1 freq havy (3) - 2 freq eeve (3) - 8 freq eq (3) - 1 freq ervo (3) - 2 freq hivy (3) - 1 freq ebv (3) - 1 freq uqay (3) - 1 freq eeva (3) - 1 freq wavy (3) - 6 freq evi (3) - 1 freq eve (3) - 80 freq heavy (3) - 196 freq davy (3) - 70 freq eqio (3) - 1 freq invy (3) - 2 freq qy (3) - 1 freq ayqv (3) - 1 freq qvt (3) - 1 freq |
SoundEx code - E210 escape - 102 freq excep - 14 freq espy - 2 freq eock-a-hoop - 1 freq equip - 1 freq expo - 1 freq eschape - 1 freq escaep - 2 freq eesefu - 3 freq ex-wife - 1 freq escheve - 1 freq egip - 1 freq €™espa - 1 freq escpae - 1 freq eowxf - 1 freq eqvy - 1 freq esp - 10 freq ezb - 1 freq eesfve - 1 freq exp - 1 freq ecb - 1 freq ecv - 1 freq egf - 1 freq |
MetaPhone code - EKF eqvy - 1 freq ecv - 1 freq egf - 1 freq |
EQVY |
| Time to execute Levenshtein function - 0.207699 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.420150 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.027276 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.037042 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.001079 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. |