| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| canfoo (0) - 1 freq canyon (2) - 1 freq calloo (2) - 2 freq waefoo (2) - 1 freq mangoo (2) - 1 freq eanoo (2) - 3 freq anoo (2) - 7 freq cerfoo (2) - 1 freq canno- (2) - 1 freq canio (2) - 1 freq canto (2) - 27 freq a'foo (2) - 1 freq canton (2) - 2 freq canon (2) - 11 freq cannot (2) - 19 freq cantor (2) - 1 freq hanfoos (2) - 1 freq canno (2) - 26 freq cannon (2) - 13 freq handfoo (2) - 1 freq canvis (3) - 1 freq cannae (3) - 1702 freq cannit (3) - 1 freq wanlos (3) - 1 freq nano- (3) - 1 freq |
canfoo (0) - 1 freq canio (3) - 1 freq canto (3) - 27 freq canno (3) - 26 freq cerfoo (3) - 1 freq conf (3) - 1 freq canon (3) - 11 freq canyon (3) - 1 freq canny (4) - 214 freq canne (4) - 7 freq canal (4) - 27 freq hanf (4) - 2 freq cunyo (4) - 2 freq canle (4) - 2 freq anof (4) - 4 freq canna (4) - 1230 freq canty (4) - 28 freq carefou (4) - 1 freq canaan (4) - 3 freq canali (4) - 2 freq canute (4) - 2 freq caffee (4) - 2 freq can' (4) - 1 freq canary (4) - 14 freq can- (4) - 4 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 - KNF kinnefa - 1 freq convo - 2 freq convoy - 12 freq convey - 6 freq cnvey - 1 freq connive - 1 freq kinneff - 1 freq canfoo - 1 freq €˜k-nife - 1 freq kennef - 1 freq conf - 1 freq qnv - 1 freq |
CANFOO |
| Time to execute Levenshtein function - 0.183064 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.330377 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.027954 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.037483 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.000899 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. |