| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obtempert (0) - 1 freq tempert (2) - 2 freq ootsmert (3) - 1 freq temper (3) - 50 freq ll-tempert (3) - 1 freq temperit (3) - 1 freq tempest (3) - 5 freq tempers (3) - 2 freq tamper (4) - 1 freq temperate (4) - 3 freq impert (4) - 1 freq bettert (4) - 2 freq attempt (4) - 81 freq bremner (4) - 3 freq temerat (4) - 1 freq blempt (4) - 2 freq extempore (4) - 1 freq tempered (4) - 3 freq ootmest (4) - 1 freq observer (4) - 3 freq obedient (4) - 2 freq beemer (4) - 2 freq tempit (4) - 11 freq despert (4) - 4 freq steeper (4) - 1 freq |
obtempert (0) - 1 freq tempert (3) - 2 freq temperit (4) - 1 freq intemperate (5) - 1 freq btsport (5) - 1 freq temperate (5) - 3 freq tempers (5) - 2 freq temper (5) - 50 freq tempest (5) - 5 freq stammert (6) - 2 freq timmert (6) - 1 freq temptet (6) - 1 freq temptt (6) - 1 freq abatement (6) - 1 freq tempt (6) - 9 freq temptit (6) - 11 freq attemptet (6) - 1 freq bit-part (6) - 2 freq bumper (6) - 4 freq tempit (6) - 11 freq stumpet (6) - 1 freq tapert (6) - 2 freq attemptit (6) - 7 freq attempt (6) - 81 freq temerat (6) - 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 - OBTMPRT obtempert - 1 freq |
OBTEMPERT |
| Time to execute Levenshtein function - 0.184159 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.369422 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.027490 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.041746 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.001040 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. |