Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ontil (0) - 53 freq until (1) - 495 freq oantil (1) - 1 freq ontilt (1) - 4 freq ontill (1) - 3 freq onkil (1) - 9 freq onti (1) - 8 freq intil (1) - 554 freq onto (2) - 20 freq o'neil (2) - 1 freq ïntil (2) - 2 freq intill (2) - 125 freq orti (2) - 1 freq onhin (2) - 2 freq onnir (2) - 1 freq onyin (2) - 1 freq til (2) - 3 freq ochil (2) - 4 freq lentil (2) - 5 freq onte (2) - 18 freq oneill (2) - 2 freq stil (2) - 5 freq onkils (2) - 1 freq onic (2) - 1 freq ostid (2) - 1 freq |
ontil (0) - 53 freq until (1) - 495 freq intil (1) - 554 freq oantil (1) - 1 freq ental (2) - 1 freq intul (2) - 1 freq untul (2) - 1 freq entel (2) - 3 freq entail (2) - 3 freq ontilt (2) - 4 freq intl (2) - 1 freq ontill (2) - 3 freq onti (2) - 8 freq onkil (2) - 9 freq 'til (3) - 15 freq ontull (3) - 1 freq intilt (3) - 11 freq atil (3) - 17 freq ingil (3) - 5 freq til (3) - 1722 freq neil (3) - 87 freq ontac (3) - 2 freq unkil (3) - 4 freq antit (3) - 1 freq oxtail (3) - 1 freq |
SoundEx code - O534 ontil - 53 freq ontill - 3 freq ontull - 1 freq ontilt - 4 freq ontolojiecal - 1 freq oantil - 1 freq onthelist - 2 freq |
MetaPhone code - ONTL ontil - 53 freq ontill - 3 freq ontull - 1 freq oantil - 1 freq |
ONTIL |
Time to execute Levenshtein function - 0.250977 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.401185 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.027756 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.037631 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.000890 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. |