| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| compy (0) - 1 freq comply (1) - 4 freq comp (1) - 3 freq copy (1) - 100 freq coapy (1) - 2 freq compo (1) - 2 freq corpy (1) - 1 freq compt (1) - 1 freq comfy (1) - 48 freq cowpt (2) - 21 freq compis (2) - 1 freq wimpy (2) - 5 freq soapy (2) - 7 freq bumpy (2) - 1 freq compel (2) - 1 freq coy (2) - 8 freq comyn (2) - 3 freq coap (2) - 2 freq coma (2) - 13 freq cops (2) - 3 freq clomph (2) - 1 freq combo (2) - 5 freq comely (2) - 4 freq cump (2) - 1 freq coops (2) - 1 freq |
compy (0) - 1 freq compo (1) - 2 freq comp (1) - 3 freq camp (2) - 53 freq compt (2) - 1 freq cump (2) - 1 freq comfy (2) - 48 freq corpy (2) - 1 freq coapy (2) - 2 freq copy (2) - 100 freq comply (2) - 4 freq campie (3) - 16 freq oompa (3) - 1 freq coup (3) - 25 freq corp (3) - 51 freq como (3) - 1 freq co-opy (3) - 2 freq romp (3) - 2 freq empy (3) - 6 freq jumpy (3) - 3 freq comma (3) - 1 freq cop (3) - 4 freq comer (3) - 4 freq comte (3) - 1 freq comic (3) - 31 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 - KMP camp - 53 freq compo - 2 freq comp - 3 freq kemp - 46 freq cump - 1 freq kempie - 1 freq kempe - 3 freq kempy - 2 freq 'camp - 1 freq campie - 16 freq gmpe - 1 freq compy - 1 freq gump - 1 freq |
COMPY |
| Time to execute Levenshtein function - 0.225103 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.694604 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.077285 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.084848 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.001811 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. |