| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| option (0) - 51 freq options (1) - 27 freq optioun (1) - 1 freq optin (1) - 1 freq caption (2) - 1 freq opinion (2) - 69 freq optit (2) - 1 freq ootin (2) - 5 freq oration (2) - 1 freq tion (2) - 1 freq oftin (2) - 1 freq onion (2) - 14 freq motion (2) - 45 freq opon (2) - 1 freq uptoon (2) - 1 freq opin (2) - 9 freq oppin (2) - 4 freq potion (2) - 12 freq nation (2) - 143 freq notion (2) - 223 freq optics (2) - 2 freq ottin (2) - 1 freq optional (2) - 4 freq adoption (2) - 16 freq portion (2) - 22 freq |
option (0) - 51 freq optioun (1) - 1 freq optin (1) - 1 freq potion (2) - 12 freq uptoon (2) - 1 freq options (2) - 27 freq outin (3) - 4 freq orton (3) - 1 freq portion (3) - 22 freq adoption (3) - 16 freq action (3) - 138 freq ection (3) - 16 freq poatin (3) - 1 freq pootin (3) - 1 freq pitin (3) - 1 freq putin (3) - 4 freq uptaen (3) - 1 freq paton (3) - 2 freq optional (3) - 4 freq poutin (3) - 2 freq lotion (3) - 4 freq ration (3) - 4 freq oration (3) - 1 freq tion (3) - 1 freq ottin (3) - 1 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 - OPXN option - 51 freq optioun - 1 freq |
OPTION |
| Time to execute Levenshtein function - 0.185910 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.333232 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.027997 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.037206 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.000771 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. |