| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kenmerk (0) - 4 freq ken-merk (1) - 1 freq kenmark (1) - 1 freq remerk (2) - 3 freq kenmore (2) - 1 freq kenmairk (2) - 2 freq kenmarks (2) - 1 freq denmark (2) - 19 freq hemmer (3) - 21 freq henery (3) - 1 freq lenders (3) - 1 freq jenners (3) - 6 freq kennlers (3) - 1 freq hemmers (3) - 1 freq keneen (3) - 2 freq kemes (3) - 1 freq kennet (3) - 1 freq render (3) - 8 freq denser (3) - 2 freq enders (3) - 2 freq merk (3) - 62 freq lender (3) - 2 freq fenders (3) - 1 freq menter (3) - 1 freq veneer (3) - 1 freq |
kenmerk (0) - 4 freq kenmark (1) - 1 freq kenmairk (2) - 2 freq ken-merk (2) - 1 freq denmark (3) - 19 freq kenmarks (3) - 1 freq kenmore (3) - 1 freq danemerk (4) - 3 freq remerk (4) - 3 freq kenmairks (4) - 6 freq knark (4) - 1 freq kinrik (5) - 37 freq merk (5) - 62 freq kinder (5) - 5 freq remark (5) - 43 freq keener (5) - 6 freq kynryk (5) - 1 freq landmerk (5) - 1 freq ken-or (5) - 1 freq kimmer (5) - 6 freq kermack (5) - 4 freq laundmerk (6) - 2 freq lanark (6) - 29 freq kongir (6) - 1 freq kintore (6) - 4 freq |
SoundEx code - K562 kinrick - 22 freq kenmairks - 6 freq kenmairk - 2 freq kinrik - 37 freq kenmerk - 4 freq knark - 1 freq kenmarks - 1 freq kynryk - 1 freq kinriks - 2 freq kinrike - 1 freq kinross - 6 freq kinricks - 1 freq kinrick-biggin - 1 freq ken-merk - 1 freq kenmark - 1 freq kinross-shire - 2 freq |
MetaPhone code - KNMRK kenmairk - 2 freq kenmerk - 4 freq ken-merk - 1 freq kenmark - 1 freq |
KENMERK |
| Time to execute Levenshtein function - 0.203085 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.350863 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.027221 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.036523 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.000773 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. |