| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| excep (0) - 14 freq excel (1) - 3 freq except (1) - 148 freq bicep (2) - 2 freq excerpt (2) - 5 freq exes (2) - 3 freq eece (2) - 8 freq expec (2) - 8 freq eep (2) - 1 freq exp (2) - 1 freq accep (2) - 12 freq ecce (2) - 1 freq excess (2) - 10 freq exten (2) - 1 freq excpet (2) - 1 freq escaep (2) - 2 freq cep (2) - 1 freq expel (2) - 1 freq expek (2) - 1 freq exe (2) - 2 freq exne (2) - 1 freq exceed (2) - 1 freq rxe (3) - 1 freq else (3) - 743 freq eried (3) - 6 freq |
excep (0) - 14 freq excel (2) - 3 freq except (2) - 148 freq excpet (3) - 1 freq accep (3) - 12 freq exceed (3) - 1 freq exp (3) - 1 freq escaep (3) - 2 freq cep (3) - 1 freq bicep (3) - 2 freq xqp (4) - 1 freq exchie (4) - 1 freq cop (4) - 4 freq xci (4) - 1 freq xc (4) - 2 freq exack (4) - 7 freq cap (4) - 47 freq exac (4) - 2 freq xcd (4) - 1 freq gcp (4) - 1 freq exact (4) - 57 freq exect (4) - 1 freq tcp (4) - 5 freq excite (4) - 2 freq recap (4) - 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 - EKSSP excep - 14 freq |
EXCEP |
| Time to execute Levenshtein function - 0.312740 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.634620 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.053797 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.067063 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.000888 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. |