| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kermack (0) - 4 freq cormack (2) - 5 freq kevmac (2) - 9 freq kenmark (2) - 1 freq kermack's (2) - 1 freq erack (2) - 1 freq german (3) - 160 freq kenmerk (3) - 4 freq lerick (3) - 1 freq germane (3) - 1 freq karma (3) - 5 freq crack (3) - 347 freq kerouac (3) - 2 freq craack (3) - 1 freq kertan (3) - 1 freq atrack (3) - 1 freq germany (3) - 36 freq lerwick (3) - 19 freq eemock (3) - 8 freq oermuch (3) - 1 freq denmark (3) - 19 freq kessock (3) - 1 freq karnak (3) - 2 freq knoack (3) - 7 freq keach (3) - 2 freq |
kermack (0) - 4 freq cormack (3) - 5 freq okrmock (3) - 1 freq erack (4) - 1 freq karmic (4) - 1 freq kermack's (4) - 1 freq kevmac (4) - 9 freq kenmark (4) - 1 freq kebbock (5) - 2 freq jeemick (5) - 2 freq wrack (5) - 39 freq ferrick (5) - 1 freq berwick (5) - 23 freq froack (5) - 2 freq werck (5) - 1 freq track (5) - 129 freq perfick (5) - 2 freq jimmack (5) - 11 freq lerrick (5) - 4 freq rack (5) - 19 freq dervock (5) - 1 freq knack (5) - 12 freq kebbuck (5) - 5 freq stamack (5) - 5 freq frack (5) - 1 freq |
SoundEx code - K652 karnak - 2 freq koreans - 1 freq karen's - 9 freq kirns - 2 freq kranky - 109 freq kranky's - 2 freq kronykil - 1 freq keyring - 2 freq kronik - 1 freq kermack - 4 freq kermack's - 1 freq karmic - 1 freq kerrying - 2 freq €œkronikill - 1 freq kieran's - 1 freq krankie - 2 freq krings - 1 freq karenisathome - 6 freq karnegie - 1 freq karencotter - 1 freq kieranjack - 1 freq karengdonald - 1 freq karenstasks - 1 freq |
MetaPhone code - KRMK crummock - 4 freq kermack - 4 freq karmic - 1 freq cormack - 5 freq graemec - 4 freq carmic - 2 freq caramac - 1 freq |
KERMACK |
| Time to execute Levenshtein function - 0.430261 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.946228 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.163964 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.118325 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.001180 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. |