| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cappuccino (0) - 10 freq cappuccinae (2) - 1 freq cappin (4) - 1 freq capturin (4) - 1 freq cappie (5) - 3 freq chauncin (5) - 1 freq approvin (5) - 3 freq cauin (5) - 1 freq crapping (5) - 1 freq carpin (5) - 2 freq appoint (5) - 2 freq puckin (5) - 10 freq appealing (5) - 1 freq lauchin (5) - 98 freq catchin (5) - 52 freq conductin (5) - 3 freq chucking (5) - 2 freq caperin (5) - 3 freq capering (5) - 1 freq cappies (5) - 1 freq causing (5) - 8 freq lappin (5) - 20 freq appenin (5) - 3 freq pappin (5) - 7 freq campain (5) - 3 freq |
cappuccino (0) - 10 freq cappuccinae (2) - 1 freq cappin (6) - 1 freq cuppin (7) - 6 freq capturin (7) - 1 freq crappin (8) - 11 freq captin (8) - 2 freq appin (8) - 2 freq happenin (8) - 144 freq appearin (8) - 22 freq campesina (8) - 1 freq appealin (8) - 6 freq chuncin (8) - 1 freq cluckin (8) - 2 freq appallin (8) - 2 freq appyntin (8) - 1 freq vaccine (8) - 6 freq campin (8) - 4 freq cappit (8) - 3 freq rappin (8) - 6 freq clappin (8) - 45 freq chuckin (8) - 17 freq computin (8) - 3 freq sprucin (8) - 1 freq captain (8) - 71 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 - KPKSN cappuccino - 10 freq cappuccinae - 1 freq qpxni - 1 freq |
CAPPUCCINO |
| Time to execute Levenshtein function - 0.209843 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.357567 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.027154 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.037049 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.000875 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. |