| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kmgwm (0) - 2 freq kmm (2) - 1 freq degwdm (3) - 1 freq mowe (3) - 1 freq kw (3) - 1 freq maum (3) - 2 freq maw (3) - 392 freq bgm (3) - 1 freq kwc (3) - 1 freq kmee (3) - 1 freq kgq (3) - 1 freq kdibm (3) - 1 freq mwh (3) - 1 freq agam (3) - 1 freq smaws (3) - 1 freq kwr (3) - 1 freq bmw (3) - 4 freq hmm (3) - 22 freq mgk (3) - 1 freq kxzwmk (3) - 1 freq know (3) - 1205 freq kowk (3) - 1 freq wm (3) - 12 freq mgy (3) - 1 freq gum (3) - 20 freq |
kmgwm (0) - 2 freq kmm (4) - 1 freq qwagwm (5) - 1 freq kargem (5) - 1 freq kim (6) - 10 freq mrim (6) - 1 freq emm (6) - 6 freq mews (6) - 1 freq kzgyl (6) - 1 freq kge (6) - 1 freq kenjm (6) - 1 freq mglr (6) - 1 freq iugw (6) - 1 freq maim (6) - 7 freq agm (6) - 2 freq gm (6) - 10 freq mhw (6) - 1 freq 'mmm (6) - 1 freq kiwi (6) - 2 freq kmc (6) - 2 freq mown (6) - 2 freq mum (6) - 181 freq gfm (6) - 1 freq knaws (6) - 4 freq wmtim (6) - 1 freq |
SoundEx code - K525 kensna - 2 freq kinkin - 3 freq knockin - 42 freq knockin' - 2 freq knoackin - 5 freq knoack'n - 2 freq knocknaconthery - 1 freq kin-kinds - 1 freq knick-knackets - 2 freq kingmakers - 1 freq knick-knacks - 2 freq kinshen - 1 freq knackin - 1 freq kinkeind - 7 freq kinsman - 5 freq knockan - 3 freq kensington - 2 freq kinsmen - 3 freq knackiness - 2 freq kinswummin - 2 freq knikkin - 1 freq kin-kynd - 2 freq knocking - 5 freq kin-kind - 1 freq keynesian - 1 freq konsonants - 1 freq konekshin - 1 freq knockknock - 1 freq kenjm - 1 freq kmgwm - 2 freq kmckenna - 22 freq kianeganwl - 1 freq knockemstiff - 1 freq knokynhayre - 1 freq knocknahane - 1 freq knokmachare - 1 freq knockmair - 1 freq knockengorroch - 6 freq kingminotaurs - 1 freq kensingtonroyal - 1 freq knockshinnoch - 1 freq knockin - 1 freq |
MetaPhone code - KMKM cmaqem - 1 freq kmgwm - 2 freq |
KMGWM |
| Time to execute Levenshtein function - 0.243574 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.391135 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.031362 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.043339 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.000908 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. |