| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obtainin (0) - 1 freq abstainin (2) - 1 freq ootlinin (2) - 2 freq containin (2) - 7 freq retainin (2) - 6 freq stainin (2) - 1 freq brainin (2) - 1 freq obtained (2) - 1 freq outlinin (2) - 1 freq obtain (2) - 2 freq tuinin (3) - 1 freq bailin (3) - 3 freq tailin (3) - 1 freq blaikin (3) - 1 freq bainie (3) - 1 freq baitin (3) - 1 freq trainin (3) - 59 freq tannin (3) - 12 freq offairin (3) - 1 freq abstainit (3) - 3 freq staanin (3) - 9 freq bannin (3) - 5 freq strainin (3) - 10 freq ordainit (3) - 1 freq sainin (3) - 4 freq |
obtainin (0) - 1 freq brainin (3) - 1 freq obtain (3) - 2 freq stainin (3) - 1 freq obtained (3) - 1 freq retainin (3) - 6 freq abstainin (3) - 1 freq beinin (4) - 1 freq bannin (4) - 5 freq staanin (4) - 9 freq stanin (4) - 25 freq bairnin (4) - 2 freq tainan (4) - 1 freq beginin (4) - 15 freq baitin (4) - 1 freq staunin (4) - 289 freq containin (4) - 7 freq outlinin (4) - 1 freq tuinin (4) - 1 freq ootlinin (4) - 2 freq battin (5) - 1 freq buttonin (5) - 4 freq bounin (5) - 1 freq broonin (5) - 2 freq boannie (5) - 59 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 - OBTNN obtainin - 1 freq |
OBTAININ |
| Time to execute Levenshtein function - 0.303225 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.694070 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.080103 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.039798 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.000948 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. |