| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kenmairks (0) - 6 freq kenmairk (1) - 2 freq kenmarks (1) - 1 freq remairks (2) - 3 freq kenmark (2) - 1 freq landmairks (3) - 1 freq mairks (3) - 15 freq remarks (3) - 25 freq remairk (3) - 5 freq denmark (3) - 19 freq kenmerk (3) - 4 freq lugmairks (3) - 1 freq remarkt (4) - 7 freq keywirds (4) - 1 freq eairds (4) - 2 freq benmaist (4) - 3 freq beckairts (4) - 1 freq kinriks (4) - 2 freq ramarks (4) - 1 freq rewairds (4) - 1 freq ken-merk (4) - 1 freq kempers (4) - 2 freq mair's (4) - 2 freq recairts (4) - 2 freq kethlicks (4) - 2 freq |
kenmairks (0) - 6 freq kenmarks (1) - 1 freq kenmairk (2) - 2 freq kenmark (3) - 1 freq remairks (4) - 3 freq kenmerk (4) - 4 freq lugmairks (5) - 1 freq kingriks (5) - 1 freq kinriks (5) - 2 freq denmark (5) - 19 freq mairks (5) - 15 freq remarks (5) - 25 freq landmairks (5) - 1 freq remerks (6) - 8 freq launmerks (6) - 1 freq knark (6) - 1 freq marks (6) - 44 freq smirks (6) - 11 freq ken-merk (6) - 1 freq unmarkt (6) - 1 freq kirks (6) - 30 freq remairk (6) - 5 freq landmarks (6) - 1 freq kenmore (6) - 1 freq ramarks (6) - 1 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 - KNMRKS kenmairks - 6 freq kenmarks - 1 freq |
KENMAIRKS |
| Time to execute Levenshtein function - 0.201122 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.376083 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.030493 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.037527 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.000889 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. |