| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exp (0) - 1 freq xp (1) - 3 freq exy (1) - 1 freq exe (1) - 2 freq eup (1) - 2 freq ep (1) - 10 freq esp (1) - 10 freq bxp (1) - 1 freq efp (1) - 1 freq exo (1) - 1 freq expo (1) - 1 freq eep (1) - 1 freq ex (1) - 32 freq lup (2) - 1 freq eng (2) - 10 freq xxv (2) - 2 freq ee (2) - 1590 freq lip (2) - 84 freq uzp (2) - 1 freq jx (2) - 4 freq mtp (2) - 1 freq ew (2) - 5 freq excep (2) - 14 freq oop (2) - 2 freq mgp (2) - 1 freq |
exp (0) - 1 freq xp (1) - 3 freq expo (1) - 1 freq efp (2) - 1 freq ex (2) - 32 freq bxp (2) - 1 freq eep (2) - 1 freq exo (2) - 1 freq exe (2) - 2 freq esp (2) - 10 freq exy (2) - 1 freq eup (2) - 2 freq ep (2) - 10 freq eppy (3) - 1 freq bp (3) - 8 freq cup (3) - 308 freq map (3) - 90 freq dxpa (3) - 1 freq i'p (3) - 2 freq neap (3) - 1 freq heap (3) - 46 freq usp (3) - 1 freq xz (3) - 4 freq teip (3) - 2 freq axt (3) - 112 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 - EKSP expo - 1 freq exp - 1 freq |
EXP |
| Time to execute Levenshtein function - 0.494042 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.831988 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.084824 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.095143 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.000832 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. |