| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| option (0) - 56 freq options (1) - 28 freq optioun (1) - 1 freq optin (1) - 1 freq notion (2) - 223 freq ottin (2) - 1 freq opin (2) - 9 freq optional (2) - 4 freq ootin (2) - 5 freq optics (2) - 2 freq oration (2) - 1 freq oftin (2) - 1 freq optit (2) - 1 freq oppin (2) - 4 freq lotion (2) - 4 freq opon (2) - 1 freq ection (2) - 16 freq orton (2) - 1 freq adoption (2) - 16 freq orion (2) - 4 freq action (2) - 138 freq portion (2) - 22 freq nation (2) - 144 freq motion (2) - 47 freq uptoon (2) - 1 freq |
option (0) - 56 freq optin (1) - 1 freq optioun (1) - 1 freq potion (2) - 13 freq options (2) - 28 freq uptoon (2) - 1 freq motion (3) - 47 freq nation (3) - 144 freq opinion (3) - 70 freq outin (3) - 4 freq ration (3) - 5 freq tion (3) - 1 freq putin (3) - 4 freq uptaen (3) - 1 freq poutin (3) - 2 freq pootin (3) - 1 freq poatin (3) - 1 freq portion (3) - 22 freq pitin (3) - 1 freq caption (3) - 1 freq paton (3) - 2 freq opin (3) - 9 freq oftin (3) - 1 freq optit (3) - 1 freq action (3) - 138 freq |
SoundEx code - O135 often - 126 freq oaften - 6 freq oaftin - 1 freq option - 56 freq obtempert - 1 freq optimistic - 11 freq oftentimes - 1 freq optimism - 8 freq options - 28 freq obedient - 2 freq obediently - 4 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 - OPXN option - 56 freq optioun - 1 freq |
OPTION |
| Time to execute Levenshtein function - 0.308626 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.666200 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.037978 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.075365 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.000937 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. |