| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| esp (0) - 10 freq ess (1) - 258 freq est (1) - 22 freq espy (1) - 2 freq es (1) - 798 freq efp (1) - 1 freq esk (1) - 22 freq eso (1) - 1 freq hesp (1) - 1 freq csp (1) - 2 freq esa (1) - 2 freq eep (1) - 1 freq esq (1) - 9 freq esps (1) - 2 freq dsp (1) - 1 freq osp (1) - 2 freq ssp (1) - 8 freq ep (1) - 10 freq exp (1) - 1 freq isp (1) - 3 freq ese (1) - 2 freq esh (1) - 6 freq msp (1) - 53 freq usp (1) - 1 freq sp (1) - 8 freq |
esp (0) - 10 freq osp (1) - 2 freq sp (1) - 8 freq espy (1) - 2 freq usp (1) - 1 freq isp (1) - 3 freq spu (2) - 1 freq spa (2) - 6 freq esd (2) - 1 freq eup (2) - 2 freq sip (2) - 28 freq sup (2) - 53 freq yasp (2) - 1 freq spo (2) - 1 freq aesop (2) - 8 freq spy (2) - 35 freq asap (2) - 10 freq sap (2) - 10 freq seep (2) - 5 freq sop (2) - 4 freq msp (2) - 53 freq spi (2) - 1 freq eso (2) - 1 freq hesp (2) - 1 freq csp (2) - 2 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 - ESP aesop - 8 freq espy - 2 freq €™espa - 1 freq esp - 10 freq |
ESP |
| Time to execute Levenshtein function - 0.492492 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.690797 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.094915 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.097081 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.001155 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. |