| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| echas (0) - 4 freq echos (1) - 2 freq echaes (1) - 2 freq echa (1) - 2 freq echae (1) - 1 freq chav (2) - 3 freq char (2) - 2 freq chats (2) - 3 freq schaws (2) - 2 freq chis (2) - 2 freq muchas (2) - 1 freq erches (2) - 1 freq ethan (2) - 1 freq ech (2) - 5 freq ehrs (2) - 2 freq chaps (2) - 24 freq cha (2) - 19 freq eck's (2) - 26 freq echaed (2) - 2 freq hechts (2) - 3 freq 'chap (2) - 1 freq echt (2) - 114 freq chaa (2) - 7 freq chaws (2) - 1 freq schar (2) - 1 freq |
echas (0) - 4 freq echaes (1) - 2 freq echos (1) - 2 freq aches (2) - 10 freq chos (2) - 1 freq echoes (2) - 26 freq chase (2) - 48 freq chaas (2) - 2 freq chis (2) - 2 freq chaos (2) - 24 freq echa (2) - 2 freq echae (2) - 1 freq echr (3) - 1 freq eichts (3) - 4 freq cheis (3) - 1 freq chaise (3) - 3 freq ochts (3) - 3 freq whas (3) - 17 freq pechs (3) - 6 freq 'has (3) - 7 freq chise (3) - 2 freq ects (3) - 4 freq chak (3) - 5 freq thas (3) - 2 freq eshes (3) - 6 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 - EXS echoes - 26 freq echaes - 2 freq echas - 4 freq eshes - 6 freq eitches - 1 freq echos - 2 freq |
ECHAS |
| Time to execute Levenshtein function - 0.382996 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.602507 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.027647 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.074451 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.000925 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. |