| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| canapie (0) - 1 freq canopie (1) - 1 freq cantie (2) - 77 freq canae (2) - 28 freq canali (2) - 2 freq campie (2) - 16 freq canadae (2) - 6 freq cannie (2) - 93 freq canopies (2) - 2 freq canaria (2) - 1 freq canopied (2) - 1 freq canapes (2) - 1 freq lalapie (2) - 1 freq caavie (2) - 2 freq coapie (2) - 4 freq cappie (2) - 3 freq daatie (3) - 6 freq bappie (3) - 1 freq maalie (3) - 7 freq callie (3) - 1 freq gantrie (3) - 1 freq cavie (3) - 2 freq caunopies (3) - 1 freq cramasie (3) - 1 freq baatie (3) - 1 freq |
canapie (0) - 1 freq canopie (1) - 1 freq canopied (3) - 1 freq canaria (3) - 1 freq coapie (3) - 4 freq cappie (3) - 3 freq canopy (3) - 10 freq canopies (3) - 2 freq canapes (3) - 1 freq cannie (3) - 93 freq campie (3) - 16 freq canae (3) - 28 freq cantie (3) - 77 freq canadae (3) - 6 freq canali (3) - 2 freq caunie (4) - 1 freq creepie (4) - 9 freq cape (4) - 14 freq canaan (4) - 3 freq canal (4) - 27 freq cuppie (4) - 27 freq canary (4) - 14 freq chape (4) - 6 freq canine (4) - 3 freq caani (4) - 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 - KNP canopy - 10 freq canopie - 1 freq canapie - 1 freq |
CANAPIE |
| Time to execute Levenshtein function - 0.206180 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.375743 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.030099 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.040721 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.000914 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. |