| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| echos (0) - 2 freq ethos (1) - 2 freq echoes (1) - 26 freq ectos (1) - 1 freq chos (1) - 1 freq echo (1) - 43 freq echas (1) - 4 freq echoin (2) - 14 freq echt (2) - 115 freq chou (2) - 4 freq aches (2) - 10 freq wechts (2) - 6 freq choc (2) - 4 freq chis (2) - 2 freq ehrs (2) - 2 freq scho (2) - 10 freq eichts (2) - 4 freq schon (2) - 1 freq erches (2) - 1 freq 'whos (2) - 2 freq chocs (2) - 1 freq ichor (2) - 1 freq echoey (2) - 1 freq becos (2) - 1 freq thos (2) - 1 freq |
echos (0) - 2 freq chos (1) - 1 freq echas (1) - 4 freq echoes (1) - 26 freq aches (2) - 10 freq chaos (2) - 24 freq echaes (2) - 2 freq ethos (2) - 2 freq chose (2) - 62 freq echo (2) - 43 freq chis (2) - 2 freq ectos (2) - 1 freq chns (3) - 1 freq chow (3) - 12 freq chase (3) - 51 freq chob (3) - 1 freq acos (3) - 2 freq cros (3) - 1 freq echr (3) - 1 freq echty (3) - 22 freq echae (3) - 1 freq chon (3) - 3 freq kechs (3) - 1 freq ehs (3) - 17 freq choss (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 - EXS echoes - 26 freq echaes - 2 freq echas - 4 freq eshes - 6 freq eitches - 1 freq echos - 2 freq |
ECHOS |
| Time to execute Levenshtein function - 0.207845 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.377652 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.028921 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.038254 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.000908 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. |