| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| champ (0) - 17 freq chap (1) - 126 freq chomp (1) - 3 freq clamp (1) - 3 freq camp (1) - 53 freq chimp (1) - 3 freq cramp (1) - 4 freq chaip (1) - 15 freq champs (1) - 2 freq chaep (1) - 4 freq harp (2) - 9 freq shaep (2) - 5 freq halp (2) - 54 freq clapp (2) - 1 freq campt (2) - 2 freq chak (2) - 5 freq clamb (2) - 2 freq chakk (2) - 4 freq hams (2) - 10 freq hame (2) - 2346 freq whap (2) - 2 freq sham (2) - 8 freq clasp (2) - 7 freq 'ham (2) - 3 freq camps (2) - 15 freq |
champ (0) - 17 freq chimp (1) - 3 freq chomp (1) - 3 freq cramp (2) - 4 freq chaip (2) - 15 freq chaep (2) - 4 freq champs (2) - 2 freq chap (2) - 126 freq camp (2) - 53 freq clamp (2) - 3 freq chum (3) - 21 freq thump (3) - 33 freq chimps (3) - 2 freq champit (3) - 11 freq chem (3) - 1 freq cump (3) - 1 freq hump (3) - 15 freq chape (3) - 6 freq cheyp (3) - 1 freq clump (3) - 18 freq hemp (3) - 3 freq cheep (3) - 13 freq champed (3) - 2 freq chums (3) - 13 freq thomp (3) - 1 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 - XMP champ - 17 freq chomp - 3 freq shampoo - 11 freq chimp - 3 freq |
CHAMP |
| Time to execute Levenshtein function - 0.204561 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.340862 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.027407 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.036863 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.000917 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. |