| 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 mairks (3) - 15 freq lugmairks (3) - 1 freq landmairks (3) - 1 freq denmark (3) - 19 freq kenmerk (3) - 4 freq remarks (3) - 25 freq remairk (3) - 5 freq keel-marks (4) - 1 freq mennirs (4) - 1 freq kermack's (4) - 1 freq kermack (4) - 4 freq remains (4) - 61 freq kenmore (4) - 1 freq delmaire (4) - 1 freq beckairts (4) - 1 freq pairks (4) - 6 freq kinnaird (4) - 1 freq kingriks (4) - 1 freq eairds (4) - 2 freq ken-merk (4) - 1 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 kingriks (5) - 1 freq kinriks (5) - 2 freq remarks (5) - 25 freq denmark (5) - 19 freq mairks (5) - 15 freq landmairks (5) - 1 freq lugmairks (5) - 1 freq ken-merk (6) - 1 freq knark (6) - 1 freq ramarks (6) - 1 freq landmarks (6) - 1 freq kirks (6) - 30 freq remerks (6) - 8 freq marks (6) - 45 freq unmarkt (6) - 1 freq smirks (6) - 14 freq kinricks (6) - 1 freq launmerks (6) - 1 freq keel-marks (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.190802 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.391128 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.027501 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.039175 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.001126 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. |