| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cosby (0) - 1 freq cossy (1) - 1 freq cosy (1) - 57 freq crosby (1) - 1 freq booby (2) - 9 freq combe (2) - 1 freq go-by (2) - 2 freq cowboy (2) - 18 freq cosla (2) - 1 freq coy (2) - 8 freq cory (2) - 2 freq dolby (2) - 3 freq cosh (2) - 12 freq gooby (2) - 2 freq cozy (2) - 4 freq nobby (2) - 1 freq toby (2) - 7 freq bosey (2) - 1 freq hobby (2) - 14 freq looby (2) - 1 freq hosey (2) - 1 freq wossy (2) - 1 freq costo (2) - 1 freq nosy (2) - 6 freq bosy (2) - 3 freq |
cosby (0) - 1 freq cosy (2) - 57 freq crosby (2) - 1 freq cossy (2) - 1 freq comb (3) - 19 freq cuby (3) - 1 freq cosie (3) - 23 freq combo (3) - 5 freq cossye (3) - 1 freq cubby (3) - 1 freq coste (3) - 1 freq casey (3) - 7 freq absby (3) - 1 freq cushy (3) - 3 freq coyb (3) - 1 freq cost (3) - 114 freq costa (3) - 7 freq camby (3) - 1 freq cosam (3) - 3 freq cos (3) - 456 freq busby (3) - 1 freq cos' (3) - 1 freq cosily (3) - 1 freq cisab (3) - 1 freq cosh (3) - 12 freq |
SoundEx code - C210 chequep - 1 freq cusp - 3 freq cosby - 1 freq check-up - 1 freq cohesive - 9 freq chekhov - 1 freq coycfuu - 1 freq cisab - 1 freq cokvi - 1 freq chickpea - 1 freq ccyaoksubb - 1 freq chuspa - 1 freq cikup - 1 freq cjisf - 1 freq |
MetaPhone code - KSB cosby - 1 freq gazebo - 1 freq |
COSBY |
| Time to execute Levenshtein function - 0.279696 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.535769 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.031393 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.037940 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.000862 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. |