| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exalts (0) - 1 freq halts (2) - 1 freq saalts (2) - 2 freq exalted (2) - 1 freq exams (2) - 19 freq exists (2) - 45 freq eats (2) - 30 freq salts (2) - 1 freq exits (2) - 2 freq malts (2) - 3 freq exaltit (2) - 1 freq exparts (2) - 1 freq walts (2) - 1 freq exiles (2) - 4 freq exact (2) - 57 freq exhales (2) - 1 freq poalis (3) - 1 freq eets (3) - 58 freq qualms (3) - 4 freq staets (3) - 3 freq eichts (3) - 4 freq stilts (3) - 9 freq eat's (3) - 1 freq examples (3) - 71 freq hats (3) - 46 freq |
exalts (0) - 1 freq exits (3) - 2 freq malts (3) - 3 freq exiles (3) - 4 freq salts (3) - 1 freq exaltit (3) - 1 freq walts (3) - 1 freq saalts (3) - 2 freq exalted (3) - 1 freq halts (3) - 1 freq exists (3) - 45 freq wilts (4) - 1 freq eelits (4) - 1 freq pelts (4) - 4 freq faults (4) - 3 freq kilts (4) - 15 freq slaets (4) - 3 freq dolts (4) - 2 freq silts (4) - 1 freq exploits (4) - 14 freq celts (4) - 9 freq melts (4) - 10 freq volts (4) - 3 freq idults (4) - 1 freq cults (4) - 6 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 - EKSLTS exalts - 1 freq |
EXALTS |
| Time to execute Levenshtein function - 0.303999 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.537220 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.061729 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.077145 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.000891 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. |