Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
excheege (0) - 1 freq excheenge (1) - 1 freq cheege (2) - 1 freq exchynge (2) - 10 freq exchange (2) - 21 freq excheynge (2) - 1 freq excheenged (2) - 2 freq exkeese (3) - 1 freq chenge (3) - 11 freq escheve (3) - 1 freq cheenge (3) - 42 freq exchie (3) - 1 freq exchanged (3) - 4 freq exchequer (3) - 2 freq exchanges (3) - 3 freq exchynges (3) - 2 freq exchynged (3) - 2 freq exceed (3) - 1 freq cheese (3) - 138 freq cherge (3) - 4 freq cheezy (4) - 1 freq cheesey (4) - 3 freq cheer (4) - 153 freq cheels (4) - 2 freq breege (4) - 1 freq |
excheege (0) - 1 freq excheenge (2) - 1 freq exchange (3) - 21 freq excheynge (3) - 1 freq exchynge (3) - 10 freq cheege (3) - 1 freq exchie (4) - 1 freq excheenged (4) - 2 freq exchynged (5) - 2 freq exchanges (5) - 3 freq exceed (5) - 1 freq cheese (5) - 138 freq cherge (5) - 4 freq exchynges (5) - 2 freq escheve (5) - 1 freq exchequer (5) - 2 freq cheenge (5) - 42 freq chenge (5) - 11 freq exchanged (5) - 4 freq cheynge (6) - 15 freq cheetie (6) - 23 freq hege (6) - 2 freq echtie (6) - 4 freq excuses (6) - 24 freq chug (6) - 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 - EKSXJ excheege - 1 freq |
EXCHEEGE |
Time to execute Levenshtein function - 0.238823 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.465295 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.028327 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.040131 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.000951 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. |