Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oftens (0) - 1 freq softens (1) - 1 freq often (1) - 126 freq oppens (2) - 4 freq oxters (2) - 46 freq aften (2) - 345 freq opens (2) - 69 freq otters (2) - 3 freq oaften (2) - 6 freq ootins (2) - 2 freq afters (2) - 3 freq oftert (2) - 1 freq attens (2) - 1 freq o'ten (2) - 1 freq offen (2) - 17 freq offess (2) - 1 freq offers (2) - 67 freq oftin (2) - 1 freq outins (2) - 1 freq owens (2) - 3 freq soften (2) - 2 freq ovens (2) - 4 freq fters (2) - 1 freq oens (2) - 1 freq 'often' (2) - 1 freq |
oftens (0) - 1 freq often (2) - 126 freq softens (2) - 1 freq oftin (3) - 1 freq tens (3) - 13 freq outins (3) - 1 freq offense (3) - 1 freq fters (3) - 1 freq saftens (3) - 3 freq extens (3) - 1 freq aften's (3) - 1 freq fens (3) - 3 freq attens (3) - 1 freq aften (3) - 345 freq stens (3) - 3 freq moutens (3) - 1 freq afens (3) - 2 freq oaften (3) - 6 freq affens (3) - 8 freq efters (3) - 1 freq afters (3) - 3 freq ootins (3) - 2 freq farns (4) - 2 freq satins (4) - 1 freq fetes (4) - 1 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 - OFTNS oftens - 1 freq |
OFTENS |
Time to execute Levenshtein function - 0.246251 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.457797 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.033301 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.042912 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.001066 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. |