| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| canopy (0) - 10 freq canon' (2) - 2 freq tanoy (2) - 1 freq candy (2) - 23 freq canny (2) - 212 freq cany (2) - 5 freq cappy (2) - 3 freq panoply (2) - 2 freq copy (2) - 97 freq co-opy (2) - 2 freq canons (2) - 1 freq canon (2) - 11 freq canary (2) - 14 freq canopie (2) - 1 freq jalopy (2) - 1 freq canty (2) - 28 freq hairpy (3) - 1 freq colony (3) - 9 freq caumly (3) - 8 freq cabons (3) - 1 freq pansy (3) - 1 freq caips (3) - 1 freq convoy (3) - 12 freq agony (3) - 19 freq vanity (3) - 10 freq |
canopy (0) - 10 freq canopie (2) - 1 freq canon (3) - 11 freq canary (3) - 14 freq canty (3) - 28 freq copy (3) - 97 freq co-opy (3) - 2 freq canny (3) - 212 freq cany (3) - 5 freq candy (3) - 23 freq cappy (3) - 3 freq co-op (4) - 15 freq chop (4) - 25 freq cape (4) - 11 freq cnoc (4) - 1 freq cani (4) - 2 freq cap (4) - 47 freq canno (4) - 26 freq coney (4) - 2 freq cnvey (4) - 1 freq canopied (4) - 1 freq canne (4) - 7 freq can (4) - 4706 freq can- (4) - 4 freq canine (4) - 3 freq |
SoundEx code - C510 comfy - 46 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 - 5 freq canopie - 1 freq cump - 1 freq comb - 18 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 |
CANOPY |
| Time to execute Levenshtein function - 0.180641 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.354390 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.029322 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.037297 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.000870 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. |