Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kemp (0) - 46 freq temp (1) - 734 freq kempe (1) - 3 freq kyemp (1) - 1 freq kecp (1) - 1 freq kempy (1) - 2 freq kelp (1) - 13 freq keip (1) - 4 freq hemp (1) - 3 freq kep (1) - 136 freq keep (1) - 1525 freq kemps (1) - 4 freq mep (2) - 13 freq iep (2) - 1 freq nerp (2) - 1 freq krmu (2) - 1 freq gump (2) - 1 freq cep (2) - 1 freq kdp (2) - 1 freq kempit (2) - 2 freq hmp (2) - 1 freq limp (2) - 19 freq krem (2) - 1 freq bump (2) - 23 freq camp (2) - 53 freq |
kemp (0) - 46 freq kempy (1) - 2 freq kyemp (1) - 1 freq kempe (1) - 3 freq kep (2) - 136 freq keep (2) - 1525 freq kempie (2) - 1 freq hemp (2) - 3 freq kemps (2) - 4 freq keip (2) - 4 freq temp (2) - 734 freq kelp (2) - 13 freq kecp (2) - 1 freq dump (3) - 30 freq romp (3) - 2 freq kempin (3) - 5 freq kowp (3) - 1 freq imp (3) - 3 freq pump (3) - 29 freq kim (3) - 10 freq kame (3) - 6 freq hump (3) - 15 freq kop (3) - 2 freq kom (3) - 2 freq lamp (3) - 79 freq |
SoundEx code - K510 knife - 102 freq knave - 48 freq kinnefa - 1 freq kemp - 46 freq 'knife - 1 freq kempie - 1 freq kempe - 3 freq knapp - 2 freq knob - 12 freq knif - 1 freq knap - 9 freq knappy - 1 freq kneb - 1 freq kinneff - 1 freq knoab - 1 freq knap-hie - 1 freq knabbie - 4 freq kempy - 2 freq kyemp - 1 freq €˜knifey - 1 freq €˜k-nife - 1 freq kumbh - 3 freq kmf - 1 freq kenobi - 1 freq kennef - 1 freq kqmv - 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 |
KEMP |
Time to execute Levenshtein function - 0.188741 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.333120 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.028075 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.037007 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.000846 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. |