| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cpwgntgr (0) - 1 freq counter (4) - 19 freq center (4) - 9 freq splinter (4) - 4 freq painter (4) - 9 freq coonter (4) - 70 freq wintir (4) - 8 freq conter (4) - 47 freq prenter (4) - 7 freq cantor (4) - 1 freq printer (4) - 2 freq €˜winter (4) - 1 freq cowgate (4) - 2 freq punter (4) - 15 freq chunter (4) - 1 freq centir (4) - 1 freq cowgang (4) - 1 freq penter (4) - 5 freq wunter (4) - 27 freq cantar (4) - 1 freq pinter (4) - 7 freq chanter (4) - 14 freq appggtr (4) - 1 freq peinter (4) - 1 freq planter (4) - 6 freq |
cpwgntgr (0) - 1 freq cowgang (7) - 1 freq chanter (8) - 14 freq pinter (8) - 7 freq wunter (8) - 27 freq penter (8) - 5 freq appggtr (8) - 1 freq cantar (8) - 1 freq planter (8) - 6 freq cawing (8) - 3 freq copywriter (8) - 1 freq winter (8) - 427 freq pwbnt (8) - 1 freq canter (8) - 3 freq peinter (8) - 1 freq pentar (8) - 1 freq coonter (8) - 70 freq wintir (8) - 8 freq splinter (8) - 4 freq counter (8) - 19 freq center (8) - 9 freq centir (8) - 1 freq conter (8) - 47 freq painter (8) - 9 freq prenter (8) - 7 freq |
SoundEx code - C125 cappuccino - 10 freq cauf-kintra - 2 freq cappuccinae - 1 freq cubismo - 1 freq cpwgntgr - 1 freq cfconnolly - 1 freq cvjsmmgt - 1 freq cfjmmkkpxa - 1 freq cfcmod - 1 freq |
MetaPhone code - KPKNTKR cpwgntgr - 1 freq |
CPWGNTGR |
| Time to execute Levenshtein function - 0.220754 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.375169 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.027754 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.037835 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.000846 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. |