| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| excess (0) - 10 freq egress (2) - 2 freq exeest (2) - 1 freq excel (2) - 3 freq recess (2) - 3 freq express (2) - 62 freq except (2) - 144 freq excuiss (2) - 3 freq access (2) - 73 freq execs (2) - 1 freq exes (2) - 3 freq exceed (2) - 1 freq abcess (2) - 2 freq enless (2) - 12 freq exems (2) - 1 freq excuses (2) - 24 freq sucess (2) - 1 freq extens (2) - 1 freq excesses (2) - 2 freq eess (2) - 1 freq excep (2) - 14 freq excuse (2) - 77 freq enters (3) - 10 freq offess (3) - 1 freq extends (3) - 10 freq |
excess (0) - 10 freq excuses (2) - 24 freq excuiss (2) - 3 freq abcess (3) - 2 freq sucess (3) - 1 freq excesses (3) - 2 freq xcssa (3) - 1 freq excuises (3) - 5 freq execs (3) - 1 freq excuse (3) - 77 freq recess (3) - 3 freq access (3) - 73 freq excused (4) - 3 freq caess (4) - 3 freq exkeeses (4) - 1 freq exeest (4) - 1 freq beciss (4) - 1 freq excuses' (4) - 2 freq excaise (4) - 6 freq ciss (4) - 1 freq bicuss (4) - 1 freq egress (4) - 2 freq cass (4) - 14 freq excusal (4) - 1 freq excessive (4) - 2 freq |
SoundEx code - E220 echoes - 26 freq 'excuse - 4 freq excuse - 77 freq easy-osie - 3 freq exack - 7 freq easy-oasy - 3 freq essex - 2 freq easy-osey - 1 freq echaes - 2 freq echas - 4 freq ecosse - 6 freq essays - 21 freq easy-osy - 2 freq eshes - 6 freq excess - 10 freq exac' - 1 freq exac - 2 freq exis - 1 freq exes - 3 freq egos - 3 freq excaise - 6 freq ekkoas - 1 freq eeses - 1 freq ecus - 1 freq eggyies - 1 freq easie-oasie - 1 freq esau's - 1 freq excuise - 10 freq €œexcuse - 6 freq eggies - 4 freq excuize - 2 freq excheege - 1 freq exkeese - 1 freq eisie-osie - 1 freq exak - 1 freq excuiss - 3 freq €˜excuse - 2 freq eccies - 3 freq echos - 2 freq €˜echoic - 2 freq ejwiaz - 7 freq eeukzwxs - 1 freq exoj - 1 freq execs - 1 freq escocia - 2 freq ekaoq - 1 freq |
MetaPhone code - EKSSS excess - 10 freq |
EXCESS |
| Time to execute Levenshtein function - 0.164466 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.308706 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.032133 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.038087 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. |