| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obedience (0) - 1 freq inobedience (2) - 2 freq obedient (2) - 2 freq owdience (2) - 10 freq 'obedient' (3) - 1 freq disobedience (3) - 1 freq credence (3) - 4 freq aadience (3) - 5 freq bedien (3) - 1 freq bedene (3) - 2 freq audience (3) - 94 freq obediently (3) - 4 freq science (4) - 76 freq pleasence (4) - 1 freq avidence (4) - 2 freq bodine (4) - 1 freq 'seence (4) - 1 freq leeshence (4) - 1 freq ordance (4) - 1 freq evidence (4) - 151 freq eminence (4) - 1 freq xperiance (4) - 1 freq expediency (4) - 1 freq bedeck (4) - 1 freq aberdeencc (4) - 16 freq |
obedience (0) - 1 freq obedient (3) - 2 freq owdience (3) - 10 freq inobedience (3) - 2 freq bedien (4) - 1 freq audience (4) - 94 freq aadience (4) - 5 freq bedene (4) - 2 freq audiance (5) - 1 freq bodice (5) - 1 freq radiance (5) - 1 freq abeyance (5) - 1 freq beirance (5) - 1 freq cadence (5) - 2 freq evidence (5) - 151 freq beyonce (5) - 1 freq eydence (5) - 1 freq eevidence (5) - 1 freq absence (5) - 20 freq bedeen (5) - 1 freq credence (5) - 4 freq obediently (5) - 4 freq ordance (5) - 1 freq avidence (5) - 2 freq disobedience (5) - 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 - OBTNS obedience - 1 freq |
OBEDIENCE |
| Time to execute Levenshtein function - 0.211508 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.358803 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.028075 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.038016 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.000928 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. |