| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| comfy (0) - 48 freq compy (1) - 1 freq uncomfy (2) - 1 freq cmsy (2) - 1 freq comfae (2) - 1 freq coaf (2) - 1 freq dumfy (2) - 3 freq comed (2) - 12 freq conf (2) - 1 freq omfj (2) - 1 freq toffy (2) - 2 freq cory (2) - 2 freq cofft (2) - 1 freq comes (2) - 962 freq omfg (2) - 1 freq comic (2) - 31 freq comp (2) - 3 freq coft (2) - 9 freq camby (2) - 1 freq coofs (2) - 5 freq combo (2) - 5 freq coof (2) - 7 freq coafs (2) - 1 freq copy (2) - 100 freq coffs (2) - 2 freq |
comfy (0) - 48 freq comfae (2) - 1 freq compy (2) - 1 freq comfor (3) - 1 freq couff (3) - 2 freq corfu (3) - 3 freq comma (3) - 1 freq coffey (3) - 3 freq coff (3) - 19 freq humfy (3) - 1 freq comyn (3) - 3 freq comm (3) - 2 freq comb (3) - 19 freq comte (3) - 1 freq comon (3) - 1 freq coman (3) - 41 freq coma (3) - 13 freq comedy (3) - 33 freq come' (3) - 2 freq cammy (3) - 10 freq como (3) - 1 freq compo (3) - 2 freq comme (3) - 3 freq comet (3) - 12 freq come (3) - 3162 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 - KMF comfy - 48 freq gumph - 1 freq comfae - 1 freq cumfae - 2 freq camphe - 1 freq kmf - 1 freq |
COMFY |
| Time to execute Levenshtein function - 0.190280 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.380524 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.029426 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.038402 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.000932 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. |