| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| often (0) - 126 freq oftin (1) - 1 freq offen (1) - 17 freq oftea (1) - 1 freq ofen (1) - 2 freq outen (1) - 7 freq ooten (1) - 9 freq o'ten (1) - 1 freq oftens (1) - 1 freq oaften (1) - 6 freq aften (1) - 345 freq soften (1) - 2 freq oven (2) - 51 freq olden (2) - 1 freq eaten (2) - 31 freq etten (2) - 35 freq ten (2) - 638 freq fen (2) - 47 freq softer (2) - 4 freq lfted (2) - 1 freq after (2) - 354 freq oapen (2) - 1 freq iffen (2) - 4 freq notten (2) - 1 freq 'often' (2) - 1 freq |
often (0) - 126 freq aften (1) - 345 freq oaften (1) - 6 freq oftin (1) - 1 freq soften (2) - 2 freq afton (2) - 3 freq oaftin (2) - 1 freq oftens (2) - 1 freq eoftn (2) - 1 freq ofen (2) - 2 freq oftea (2) - 1 freq o'ten (2) - 1 freq offen (2) - 17 freq ooten (2) - 9 freq outen (2) - 7 freq offin (3) - 20 freq ontaen (3) - 1 freq exten (3) - 1 freq ifter (3) - 1 freq efter (3) - 3150 freq afen (3) - 4 freq ootin (3) - 5 freq footan (3) - 1 freq inten (3) - 2 freq aiten (3) - 4 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 - OFTN often - 126 freq oaften - 6 freq oaftin - 1 freq 'often' - 1 freq oftin - 1 freq |
OFTEN |
| Time to execute Levenshtein function - 0.210907 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.372221 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.027897 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.037546 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.000865 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. |