| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ochts (0) - 3 freq ocht (1) - 317 freq nochts (1) - 1 freq ocht's (1) - 1 freq tochts (1) - 6 freq oucht (2) - 21 freq chits (2) - 1 freq ochils (2) - 8 freq oche (2) - 1 freq nocht (2) - 211 freq ehts (2) - 1 freq machts (2) - 2 freq hochs (2) - 12 freq cuts (2) - 45 freq ncht (2) - 5 freq tocht (2) - 166 freq ohms (2) - 1 freq oats (2) - 37 freq ochie (2) - 8 freq buchts (2) - 7 freq docht (2) - 4 freq ects (2) - 4 freq thts (2) - 3 freq rochs (2) - 1 freq achty (2) - 1 freq |
ochts (0) - 3 freq chats (2) - 3 freq yachts (2) - 2 freq eichts (2) - 4 freq chits (2) - 1 freq tochts (2) - 6 freq ocht (2) - 317 freq ocht's (2) - 1 freq nochts (2) - 1 freq lichts (3) - 180 freq echty (3) - 22 freq cheats (3) - 2 freq chates (3) - 1 freq acts (3) - 43 freq hichts (3) - 10 freq fechts (3) - 31 freq fichts (3) - 1 freq cots (3) - 2 freq echt (3) - 115 freq ucht (3) - 1 freq echos (3) - 2 freq ochres (3) - 2 freq tichts (3) - 1 freq dichts (3) - 7 freq pechts (3) - 77 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 - OXTS ochts - 3 freq ocht's - 1 freq |
OCHTS |
| Time to execute Levenshtein function - 0.197748 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.407703 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.029662 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.039725 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.000871 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. |