| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| espy (0) - 2 freq eppy (1) - 1 freq esp (1) - 10 freq spy (1) - 35 freq empy (1) - 6 freq esps (1) - 2 freq etsy (2) - 1 freq est (2) - 22 freq spey (2) - 4 freq mpy (2) - 1 freq es (2) - 798 freq spo (2) - 1 freq vespa (2) - 2 freq esq (2) - 9 freq rsky (2) - 1 freq usp (2) - 1 freq emdy (2) - 4 freq sky (2) - 429 freq suy (2) - 1 freq evy (2) - 1 freq spk (2) - 1 freq empty (2) - 207 freq syy (2) - 1 freq spi (2) - 1 freq emty (2) - 3 freq |
espy (0) - 2 freq spy (1) - 35 freq esp (1) - 10 freq spu (2) - 1 freq spo (2) - 1 freq spa (2) - 6 freq usp (2) - 1 freq spi (2) - 1 freq osp (2) - 2 freq spey (2) - 4 freq empy (2) - 6 freq eppy (2) - 1 freq esps (2) - 2 freq sp (2) - 8 freq isp (2) - 3 freq wispy (3) - 5 freq csp (3) - 2 freq eesy (3) - 2 freq spl (3) - 4 freq ese (3) - 2 freq keepy (3) - 1 freq ppy (3) - 1 freq spys (3) - 5 freq issy (3) - 1 freq esh (3) - 6 freq |
SoundEx code - E210 escape - 99 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 - ESP aesop - 8 freq espy - 2 freq €™espa - 1 freq esp - 10 freq |
ESPY |
| Time to execute Levenshtein function - 0.182988 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.347381 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.027580 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.037851 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.000862 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. |