Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
exes (0) - 3 freq eves (1) - 1 freq axes (1) - 23 freq texes (1) - 3 freq exems (1) - 1 freq sexes (1) - 5 freq eres (1) - 1 freq vexes (1) - 3 freq ees (1) - 87 freq enes (1) - 2 freq ewes (1) - 6 freq exe (1) - 2 freq eyes (1) - 665 freq exis (1) - 1 freq execs (1) - 1 freq heles (2) - 1 freq ex (2) - 34 freq exams (2) - 19 freq eets (2) - 58 freq lues (2) - 1 freq eyls (2) - 3 freq expel (2) - 1 freq eet (2) - 581 freq gies (2) - 516 freq tees (2) - 3 freq |
exes (0) - 3 freq exis (1) - 1 freq axes (1) - 23 freq eyes (2) - 665 freq exe (2) - 2 freq xs (2) - 2 freq axis (2) - 7 freq ewes (2) - 6 freq aixes (2) - 4 freq execs (2) - 1 freq enes (2) - 2 freq texes (2) - 3 freq eves (2) - 1 freq sexes (2) - 5 freq exems (2) - 1 freq eres (2) - 1 freq vexes (2) - 3 freq ees (2) - 87 freq egos (3) - 4 freq jees (3) - 3 freq baes (3) - 17 freq tues (3) - 6 freq les (3) - 7 freq eras (3) - 2 freq ves (3) - 2 freq |
SoundEx code - E220 echoes - 26 freq 'excuse - 4 freq excuse - 78 freq easy-osie - 3 freq exack - 7 freq easy-oasy - 3 freq essex - 2 freq easy-osey - 1 freq echaes - 2 freq eseaes - 1 freq egos - 4 freq eases - 1 freq essays - 22 freq echas - 4 freq ecosse - 6 freq easy-osy - 2 freq eshes - 6 freq excess - 10 freq exac' - 1 freq exac - 2 freq exis - 1 freq exes - 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 - EKSS exis - 1 freq exes - 3 freq ecossaise - 1 freq eccies - 3 freq |
EXES |
Time to execute Levenshtein function - 0.247867 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.371600 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.027998 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.037964 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.000884 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. |