| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| euphemism (0) - 1 freq extremism (3) - 1 freq spheris (4) - 1 freq emphasise (4) - 5 freq eemis (4) - 12 freq euphoria (4) - 4 freq extremis (4) - 2 freq chemist (4) - 11 freq utheris (4) - 1 freq totemism (4) - 1 freq premium (4) - 2 freq phemie (4) - 2 freq optimism (4) - 8 freq emphisis (4) - 1 freq chemise (4) - 2 freq emphasis (4) - 18 freq eucharist (4) - 3 freq expremes (4) - 1 freq alchemist (4) - 2 freq upheid (4) - 1 freq ephemera (4) - 1 freq euphoric (4) - 3 freq quheill (5) - 1 freq empress (5) - 3 freq tunesisme (5) - 1 freq |
euphemism (0) - 1 freq optimism (5) - 8 freq premium (6) - 2 freq phemie (6) - 2 freq thomasm (6) - 5 freq totemism (6) - 1 freq ephemera (6) - 1 freq chemise (6) - 2 freq extremism (6) - 1 freq chemist (6) - 11 freq hemm (7) - 12 freq hems (7) - 8 freq premises (7) - 14 freq uphauds (7) - 8 freq upheezes (7) - 1 freq ephemerae (7) - 1 freq promis (7) - 7 freq promise (7) - 119 freq ephasus (7) - 1 freq upcomes (7) - 1 freq upcumm (7) - 1 freq permis (7) - 1 freq photis (7) - 1 freq phem (7) - 1 freq preeemium (7) - 1 freq |
SoundEx code - E152 evens - 1 freq ewbank - 1 freq ebenezer - 36 freq epwinkle - 1 freq evaungelists - 1 freq evangelists - 1 freq evans - 27 freq euphemism - 1 freq euphemistically - 1 freq evangelistic - 1 freq eabmclc - 1 freq evangelism - 1 freq |
MetaPhone code - EFMSM euphemism - 1 freq |
EUPHEMISM |
| Time to execute Levenshtein function - 0.254619 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.548332 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.042695 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.070722 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.004113 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. |