| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| escalates (0) - 1 freq escalate (1) - 3 freq escalator (2) - 4 freq escalace (2) - 1 freq escapades (2) - 2 freq sclates (2) - 14 freq escalatit (2) - 1 freq scaldies (3) - 2 freq sclaters (3) - 4 freq sclaves (3) - 2 freq descartes (3) - 3 freq oscillates (3) - 1 freq slates (3) - 53 freq estates (3) - 19 freq enclaves (3) - 6 freq escapes (3) - 4 freq escapade (3) - 2 freq emanates (3) - 1 freq sclytes (3) - 1 freq sklates (3) - 1 freq estimates (3) - 1 freq sclate (3) - 7 freq scales (3) - 22 freq palates (3) - 1 freq nicolytes (4) - 1 freq |
escalates (0) - 1 freq sclates (2) - 14 freq escalate (2) - 3 freq escalator (3) - 4 freq escalatit (3) - 1 freq sclytes (3) - 1 freq slates (4) - 53 freq sclate (4) - 7 freq scales (4) - 22 freq sklates (4) - 1 freq oscillates (4) - 1 freq escapades (4) - 2 freq scaldies (4) - 2 freq sclaters (4) - 4 freq escalace (4) - 1 freq sclaves (4) - 2 freq acolytes (5) - 1 freq scuilmates (5) - 1 freq scairts (5) - 1 freq scarts (5) - 9 freq saalts (5) - 2 freq salts (5) - 1 freq scants (5) - 1 freq scalesy (5) - 1 freq clutes (5) - 4 freq |
SoundEx code - E243 eagle-eyed - 2 freq eaglet - 14 freq ecouldnae - 1 freq equality - 34 freq escalator - 4 freq excelled - 1 freq exultation - 1 freq exhaled - 7 freq escalate - 3 freq escalates - 1 freq exalts - 1 freq excluded - 4 freq exclude - 4 freq ecaalt - 1 freq egalitarianism - 3 freq equality' - 1 freq excludet - 1 freq exiled - 6 freq ecouldna - 1 freq excludit - 7 freq equalitie - 4 freq equaility's - 1 freq excludit' - 1 freq ecalled - 1 freq easy-led - 1 freq eiggilt - 1 freq escalatit - 1 freq excludes - 1 freq egalitar-ian - 1 freq exultant - 1 freq exalted - 1 freq exaltit - 1 freq eagled - 1 freq excluding - 1 freq excludin - 1 freq eslidcmc - 1 freq |
MetaPhone code - ESKLTS escalates - 1 freq |
ESCALATES |
| Time to execute Levenshtein function - 0.476024 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.984981 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.032520 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.092932 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.000893 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. |