| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| otamatic (0) - 1 freq dramatic (2) - 28 freq traumatic (3) - 3 freq dramatics (3) - 1 freq static (3) - 10 freq aromatic (3) - 2 freq pragmatic (3) - 5 freq climatic (3) - 1 freq idomatic (3) - 1 freq fanatic (3) - 5 freq tamatas (3) - 2 freq tamasin (3) - 1 freq dramatis (3) - 1 freq shamanic (3) - 2 freq operatic (3) - 2 freq aramaic (3) - 3 freq instamatic (3) - 1 freq automatic (3) - 11 freq somatic (3) - 1 freq tamata (3) - 8 freq thematic (3) - 4 freq tactic (3) - 2 freq atlantic (4) - 20 freq estimatit (4) - 2 freq prismatic (4) - 1 freq |
otamatic (0) - 1 freq automatic (3) - 11 freq tamatas (4) - 2 freq somatic (4) - 1 freq thematic (4) - 4 freq tamata (4) - 8 freq idomatic (4) - 1 freq tactic (4) - 2 freq aromatic (4) - 2 freq dramatic (4) - 28 freq traumatic (4) - 3 freq automatit (5) - 1 freq automatik (5) - 1 freq tamataes (5) - 1 freq demotic (5) - 5 freq tae-tac (5) - 1 freq attic (5) - 15 freq tomato (5) - 4 freq semitic (5) - 1 freq tactica (5) - 2 freq tamet (5) - 1 freq climatic (5) - 1 freq tomatas (5) - 3 freq tomata (5) - 5 freq tomaties (5) - 1 freq |
SoundEx code - O353 otamatic - 1 freq oot-an-oot - 3 freq oot-wintered - 1 freq oot-and-oot - 1 freq owthenticitie - 2 freq owthenticallie - 1 freq out-and-out - 1 freq |
MetaPhone code - OTMTK otamatic - 1 freq |
OTAMATIC |
| Time to execute Levenshtein function - 0.389948 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.511890 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.032504 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.055317 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.001189 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. |