| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| optician (0) - 4 freq optics (3) - 2 freq optimism (3) - 8 freq pickan (3) - 4 freq pricin (3) - 2 freq morticia (3) - 3 freq optin (3) - 1 freq opinion (3) - 70 freq magician (3) - 7 freq official (3) - 148 freq opingan (3) - 1 freq vatican (3) - 1 freq spaicial (3) - 9 freq stickan (3) - 4 freq politician (3) - 11 freq noticin (3) - 20 freq opteecians (3) - 1 freq musician (3) - 11 freq optioun (3) - 1 freq galician (3) - 2 freq speicial (3) - 1 freq enticin (3) - 1 freq opeinion (3) - 3 freq opeenian (3) - 1 freq notican (3) - 1 freq |
optician (0) - 4 freq optics (4) - 2 freq optioun (4) - 1 freq noticin (4) - 20 freq vatican (4) - 1 freq enticin (4) - 1 freq notican (4) - 1 freq optin (4) - 1 freq opteecians (4) - 1 freq politician (4) - 11 freq pricin (4) - 2 freq option (4) - 56 freq oxytocin (5) - 1 freq pitin (5) - 1 freq pacin (5) - 12 freq placin (5) - 17 freq pitman (5) - 1 freq petition (5) - 11 freq puitin (5) - 2 freq uptick (5) - 1 freq piecin (5) - 1 freq poleetician (5) - 2 freq poetical (5) - 3 freq pacean (5) - 1 freq optional (5) - 4 freq |
SoundEx code - O132 oobits - 5 freq optics - 2 freq optician - 4 freq opteecians - 1 freq ofdg - 1 freq obwtoz - 1 freq |
MetaPhone code - OPTXN optician - 4 freq |
OPTICIAN |
| Time to execute Levenshtein function - 0.208348 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.428256 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.027986 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.050388 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.000878 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. |