Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
onti (0) - 8 freq ontil (1) - 53 freq onty (1) - 3 freq ont (1) - 5 freq onta (1) - 2 freq orti (1) - 1 freq anti (1) - 11 freq onto (1) - 20 freq oni (1) - 1 freq onte (1) - 18 freq inti (1) - 218 freq onli (1) - 40 freq ooto (2) - 85 freq sti (2) - 1 freq untie (2) - 2 freq out' (2) - 2 freq ponte (2) - 1 freq outs (2) - 1 freq o't (2) - 277 freq oxi (2) - 2 freq ostid (2) - 1 freq anxi (2) - 4 freq on's (2) - 4 freq ottin (2) - 1 freq ona (2) - 14 freq |
onti (0) - 8 freq onto (1) - 20 freq inti (1) - 218 freq anti (1) - 11 freq onte (1) - 18 freq onty (1) - 3 freq ont (1) - 5 freq onta (1) - 2 freq onutu (2) - 1 freq ante (2) - 1 freq inta (2) - 110 freq anto (2) - 1 freq yont (2) - 14 freq inty (2) - 21 freq oanty (2) - 3 freq int (2) - 31 freq ant (2) - 8 freq oantie (2) - 1 freq nt (2) - 34 freq unty (2) - 4 freq ent (2) - 3 freq into (2) - 198 freq onli (2) - 40 freq oni (2) - 1 freq ontil (2) - 53 freq |
SoundEx code - O530 ontae - 350 freq on't - 39 freq oantae - 99 freq owned - 23 freq onto - 20 freq on-it - 2 freq one-day - 1 freq o'need - 1 freq onywey-heid - 1 freq oanty - 3 freq oantie - 1 freq onty - 3 freq ont - 5 freq onte - 18 freq onywuty - 1 freq oneywutiy - 1 freq onta - 2 freq oneywuty - 8 freq onywety - 1 freq ownit - 8 freq onno't - 1 freq oan't - 3 freq one-eyed - 1 freq on'-at - 1 freq onti - 8 freq ond - 1 freq €“on-ti - 1 freq onyday - 1 freq on-tae - 1 freq onduee - 1 freq onutu - 1 freq |
MetaPhone code - ONT ontae - 350 freq on't - 39 freq oantae - 99 freq owned - 23 freq onto - 20 freq on-it - 2 freq one-day - 1 freq o'need - 1 freq oanty - 3 freq oantie - 1 freq onty - 3 freq ont - 5 freq onte - 18 freq onta - 2 freq ownit - 8 freq onno't - 1 freq oan't - 3 freq on'-at - 1 freq onti - 8 freq ond - 1 freq €“on-ti - 1 freq onyday - 1 freq on-tae - 1 freq onduee - 1 freq onutu - 1 freq |
ONTI |
Time to execute Levenshtein function - 0.184261 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.318525 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.027987 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.037127 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.000885 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. |