| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| optimistic (0) - 11 freq optimists (2) - 2 freq oaptimist (3) - 1 freq optimism (3) - 6 freq optimistically (4) - 2 freq artistic (4) - 21 freq altruistic (4) - 1 freq antibiotic (4) - 1 freq fatalistic (4) - 3 freq atavistic (4) - 1 freq atheistic (4) - 1 freq nihilistic (4) - 1 freq stylistic (4) - 1 freq statistic (4) - 6 freq pessimistic (4) - 1 freq otamatic (4) - 1 freq futuristic (4) - 2 freq autistic (4) - 2 freq activists' (5) - 1 freq reimishis (5) - 1 freq politic (5) - 5 freq outlestin (5) - 1 freq epileptic (5) - 4 freq speiritit (5) - 1 freq optics (5) - 2 freq |
optimistic (0) - 11 freq optimists (3) - 2 freq oaptimist (4) - 1 freq optimism (5) - 6 freq statistic (6) - 6 freq pessimistic (6) - 1 freq stylistic (6) - 1 freq autistic (6) - 2 freq atheistic (6) - 1 freq futuristic (6) - 2 freq otamatic (6) - 1 freq optimistically (6) - 2 freq artistic (6) - 21 freq altruistic (6) - 1 freq fatalistic (6) - 3 freq atavistic (6) - 1 freq patriotic (7) - 11 freq automatic (7) - 11 freq postmestir (7) - 1 freq airtistic (7) - 8 freq ootmaist (7) - 14 freq domestic (7) - 20 freq plastic (7) - 125 freq ootmest (7) - 1 freq plestic (7) - 4 freq |
SoundEx code - O135 often - 126 freq oaften - 6 freq oaftin - 1 freq option - 51 freq obtempert - 1 freq optimistic - 11 freq oftentimes - 1 freq optimism - 6 freq obedient - 2 freq obediently - 4 freq options - 27 freq obtain - 2 freq optimistically - 2 freq oftens - 1 freq 'often' - 1 freq oftin - 1 freq obedience - 1 freq 'obedient' - 1 freq optional - 4 freq obtained - 1 freq optioun - 1 freq oaptimist - 1 freq €˜optimizers - 1 freq obtainin - 1 freq optimal - 1 freq optimists - 2 freq optin - 1 freq obtainable - 2 freq |
MetaPhone code - OPTMSTK optimistic - 11 freq |
OPTIMISTIC |
| Time to execute Levenshtein function - 0.176078 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.378887 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.029655 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.037311 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.000779 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. |