| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cvmkjktklr (0) - 1 freq compuiteir (6) - 1 freq computer (6) - 109 freq compostela (6) - 1 freq computeir (6) - 4 freq cgbkjgld (6) - 1 freq jklr (6) - 1 freq viktor (6) - 1 freq makker (6) - 7 freq compluther (6) - 1 freq commuter (6) - 1 freq vokakgl (6) - 1 freq chekker (6) - 1 freq pvjkjbtsc (6) - 1 freq lvcocktvr (6) - 1 freq makkar (6) - 3 freq mukkler (6) - 1 freq zmkjzdkfg (6) - 1 freq comforter (6) - 2 freq nvfquktky (6) - 1 freq completely (6) - 89 freq cemical (7) - 1 freq mackellar (7) - 1 freq comets (7) - 12 freq mortar (7) - 9 freq |
cvmkjktklr (0) - 1 freq mukkler (11) - 1 freq makkar (12) - 3 freq lvcocktvr (12) - 1 freq chekker (12) - 1 freq pvjkjbtsc (12) - 1 freq zmkjzdkfg (12) - 1 freq mjtaylor (12) - 1 freq completely (12) - 89 freq comforter (12) - 2 freq vokakgl (12) - 1 freq nvfquktky (12) - 1 freq computeir (12) - 4 freq compostela (12) - 1 freq commuter (12) - 1 freq compuiteir (12) - 1 freq cgbkjgld (12) - 1 freq computer (12) - 109 freq jklr (12) - 1 freq makker (12) - 7 freq viktor (12) - 1 freq compluther (12) - 1 freq mukkil (13) - 155 freq comfortable (13) - 38 freq hatmakker (13) - 2 freq |
SoundEx code - C152 coffins' - 2 freq chaffinches - 1 freq chauvinist - 1 freq coupons - 11 freq cabons - 1 freq cauf-muscles - 1 freq cauf-muscle - 1 freq coffin's - 1 freq cabins - 2 freq cupiennius - 1 freq copinsay - 2 freq cevennes - 1 freq cofhns - 1 freq coffins - 6 freq chiffins - 1 freq chiefness - 1 freq chaffing - 2 freq chauvinism - 1 freq cowping - 1 freq cupping - 1 freq covington - 1 freq chapping - 5 freq chauvinistic - 1 freq cvmkjktklr - 1 freq coping - 2 freq chiefmiekelson - 1 freq cifmcd - 1 freq chefmcalpine - 1 freq chopping - 1 freq couping - 1 freq chipping - 1 freq cbymooqj - 1 freq |
MetaPhone code - KFMKJKTK |
CVMKJKTKLR |
| Time to execute Levenshtein function - 0.286761 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.448048 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.028249 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.037641 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.000910 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. |