| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| campie (0) - 16 freq campsie (1) - 2 freq campin (1) - 4 freq camphe (1) - 1 freq cample (1) - 5 freq cappie (1) - 3 freq campit (1) - 2 freq crampit (2) - 2 freq cairie (2) - 4 freq campos (2) - 1 freq mammie (2) - 6 freq mcalpie (2) - 1 freq carlie (2) - 2 freq pumpie (2) - 2 freq camping (2) - 3 freq scampi (2) - 1 freq cassie (2) - 10 freq cuppie (2) - 27 freq hempie (2) - 2 freq bappie (2) - 1 freq rammie (2) - 9 freq cattie (2) - 2 freq canapie (2) - 1 freq campie's (2) - 1 freq ample (2) - 9 freq |
campie (0) - 16 freq campsie (2) - 2 freq camp (2) - 53 freq cappie (2) - 3 freq campit (2) - 2 freq campin (2) - 4 freq camphe (2) - 1 freq cample (2) - 5 freq copie (3) - 17 freq came (3) - 899 freq dumpie (3) - 1 freq coopie (3) - 2 freq empie (3) - 25 freq cumbie (3) - 1 freq canopie (3) - 1 freq humpie (3) - 1 freq compo (3) - 2 freq campion (3) - 4 freq coapie (3) - 4 freq campt (3) - 2 freq comlie (3) - 1 freq carpe (3) - 2 freq kempie (3) - 1 freq camper (3) - 1 freq compis (3) - 1 freq |
SoundEx code - C510 comfy - 48 freq canopy - 10 freq camp - 53 freq compo - 2 freq combo - 5 freq convo - 2 freq champ - 17 freq chomp - 3 freq convoy - 12 freq comp - 3 freq convey - 6 freq canopie - 1 freq cump - 1 freq canapie - 1 freq comb - 19 freq comfae - 1 freq cumfae - 2 freq camphe - 1 freq cnvey - 1 freq connive - 1 freq 'camp - 1 freq canfoo - 1 freq campie - 16 freq cumbie - 1 freq caimb - 9 freq cum-by - 1 freq combe - 1 freq chimp - 3 freq csmb - 1 freq compy - 1 freq czmpf - 1 freq conf - 1 freq camby - 1 freq |
MetaPhone code - KMP camp - 53 freq compo - 2 freq comp - 3 freq kemp - 46 freq cump - 1 freq kempie - 1 freq kempe - 3 freq kempy - 2 freq 'camp - 1 freq campie - 16 freq gmpe - 1 freq compy - 1 freq gump - 1 freq |
CAMPIE |
| Time to execute Levenshtein function - 0.245871 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.395045 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.031971 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.043520 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.000937 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. |