| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| canopie (0) - 1 freq canopies (1) - 2 freq canapie (1) - 1 freq canopied (1) - 1 freq copie (2) - 17 freq calorie (2) - 1 freq cannie (2) - 93 freq cappie (2) - 3 freq canopy (2) - 10 freq coopie (2) - 2 freq caunopies (2) - 1 freq canonbie (2) - 1 freq campie (2) - 16 freq cantie (2) - 77 freq bantie (3) - 3 freq canle (3) - 2 freq caavie (3) - 2 freq carnegie (3) - 8 freq canine (3) - 3 freq casie (3) - 3 freq campsie (3) - 2 freq nosie (3) - 1 freq cronie (3) - 2 freq copin (3) - 4 freq handie (3) - 3 freq |
canopie (0) - 1 freq canapie (1) - 1 freq canopy (2) - 10 freq canopied (2) - 1 freq canopies (2) - 2 freq coopie (3) - 2 freq cantie (3) - 77 freq campie (3) - 16 freq caunopies (3) - 1 freq cappie (3) - 3 freq copie (3) - 17 freq cannie (3) - 93 freq canni (4) - 6 freq canapes (4) - 1 freq caunie (4) - 1 freq canali (4) - 2 freq cane (4) - 22 freq canadae (4) - 6 freq cape (4) - 14 freq cannaee (4) - 1 freq cope (4) - 36 freq connie (4) - 2 freq snipie (4) - 4 freq cuppie (4) - 27 freq canon (4) - 11 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 |
CANOPIE |
| Time to execute Levenshtein function - 0.201643 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.366481 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.028230 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.037141 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.000950 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. |