Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ojtijtxvg (0) - 1 freq fjttv (5) - 1 freq omitting (5) - 1 freq jointing (5) - 1 freq optit (5) - 1 freq intiative (5) - 1 freq ontilt (5) - 4 freq tjtvt (5) - 1 freq ojxg (5) - 1 freq outing (5) - 2 freq titters (6) - 1 freq autistic (6) - 2 freq drifting (6) - 1 freq jottit (6) - 1 freq lifting (6) - 3 freq oakiv (6) - 1 freq wtlqtxl (6) - 1 freq orbit (6) - 10 freq juikt (6) - 2 freq jinxed (6) - 2 freq detective (6) - 23 freq cognitive (6) - 8 freq dating (6) - 8 freq stiling (6) - 1 freq insisting (6) - 1 freq |
ojtijtxvg (0) - 1 freq tjtvt (8) - 1 freq fjttv (9) - 1 freq jotting (9) - 6 freq omitting (9) - 1 freq ojxg (9) - 1 freq jointing (9) - 1 freq intiative (9) - 1 freq jojv (10) - 1 freq hitting (10) - 4 freq texting (10) - 1 freq tjnvh (10) - 1 freq testing (10) - 12 freq anti-tax (10) - 1 freq pitting (10) - 1 freq jxvp (10) - 1 freq patting (10) - 2 freq stating (10) - 1 freq totve (10) - 1 freq cutting (10) - 16 freq attentive (10) - 1 freq jtmt (10) - 6 freq rotting (10) - 1 freq sterting (10) - 1 freq betting (10) - 2 freq |
SoundEx code - O232 okiedokie - 1 freq octogenarian - 1 freq 'okaydoky - 1 freq okay-dokay - 1 freq oxides - 1 freq ostaig - 2 freq octogenarians - 1 freq ochts - 3 freq oxdzo - 1 freq ouexutjyau - 1 freq owstqem - 1 freq oxytocin - 1 freq okdaqszwvz - 1 freq ojtijtxvg - 1 freq ocht's - 1 freq |
MetaPhone code - OJTJTKSF |
OJTIJTXVG |
Time to execute Levenshtein function - 0.214960 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.409664 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.030153 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.039115 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.000849 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. |