Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ontak (0) - 33 freq ontae (1) - 343 freq intak (1) - 2 freq onta (1) - 2 freq ontaks (1) - 13 freq ontac (1) - 2 freq onthank (2) - 1 freq inta (2) - 109 freq tntae (2) - 1 freq €œtak (2) - 10 freq gontae (2) - 7 freq oota (2) - 53 freq ootac (2) - 1 freq entae (2) - 43 freq ootae (2) - 83 freq oak (2) - 16 freq tak (2) - 2818 freq intaa (2) - 1 freq onnay (2) - 1 freq intae (2) - 4586 freq onna (2) - 18 freq entaik (2) - 1 freq intac (2) - 2 freq onte (2) - 18 freq ental (2) - 1 freq |
ontak (0) - 33 freq intak (1) - 2 freq intake (2) - 4 freq entaik (2) - 1 freq ontac (2) - 2 freq ontaks (2) - 13 freq ontae (2) - 343 freq onta (2) - 2 freq ontaen (3) - 1 freq uptak (3) - 14 freq noak (3) - 3 freq ontil (3) - 53 freq intack (3) - 1 freq ont (3) - 5 freq 'tak (3) - 24 freq onty (3) - 3 freq intaks (3) - 1 freq intay (3) - 3 freq antiek (3) - 1 freq stak (3) - 9 freq oantae (3) - 89 freq untae (3) - 13 freq entac (3) - 1 freq onti (3) - 8 freq onto (3) - 20 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 - ONTK ontac - 2 freq ontak - 33 freq |
ONTAK |
Time to execute Levenshtein function - 0.227331 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.366047 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.052526 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.037315 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.000868 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. |