| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ontaks (0) - 13 freq ontak (1) - 33 freq intaks (1) - 1 freq €œtaks (2) - 1 freq sneaks (2) - 3 freq taks (2) - 455 freq contacks (2) - 2 freq onta (2) - 2 freq onfaws (2) - 2 freq ontaen (2) - 1 freq staks (2) - 4 freq intak (2) - 2 freq contraks (2) - 1 freq ontac (2) - 2 freq onks (2) - 1 freq ontae (2) - 343 freq intake (2) - 4 freq oaks (2) - 1 freq ootfaws (3) - 1 freq ants (3) - 5 freq donks (3) - 5 freq takk (3) - 89 freq santas (3) - 2 freq ental (3) - 1 freq sottars (3) - 3 freq |
ontaks (0) - 13 freq intaks (1) - 1 freq ontak (2) - 33 freq staks (3) - 4 freq intak (3) - 2 freq onks (3) - 1 freq taks (3) - 455 freq intake (3) - 4 freq ents (4) - 1 freq nts (4) - 1 freq taeks (4) - 1 freq entaik (4) - 1 freq anoraks (4) - 2 freq stakes (4) - 6 freq yytks (4) - 1 freq inlaiks (4) - 1 freq noks (4) - 1 freq necks (4) - 24 freq entails (4) - 1 freq toks (4) - 1 freq nats (4) - 2 freq neuks (4) - 30 freq entaels (4) - 1 freq inte's (4) - 13 freq antics (4) - 12 freq |
SoundEx code - O532 on-eh-dugs - 1 freq on'ts - 1 freq ontac - 2 freq ontak - 33 freq ontaks - 13 freq oonoticed - 1 freq onduchtie - 1 freq ondistrubilt - 1 freq |
MetaPhone code - ONTKS on-eh-dugs - 1 freq ontaks - 13 freq |
ONTAKS |
| Time to execute Levenshtein function - 0.216915 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.417503 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.028874 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.041003 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.000910 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. |