Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kensna (0) - 2 freq kentna (1) - 12 freq kenna (1) - 11 freq deusna (2) - 1 freq tentna (2) - 2 freq keyna (2) - 4 freq kensit (2) - 1 freq kenya (2) - 6 freq henna (2) - 7 freq wesna (2) - 145 freq kanna (2) - 1 freq weisna (2) - 3 freq kensho (2) - 1 freq ken-nae (2) - 3 freq jenna (2) - 5 freq kennan (2) - 14 freq kenan (2) - 3 freq menna (2) - 3 freq kens (2) - 533 freq kennt (2) - 151 freq mensa (2) - 1 freq kennae (2) - 1 freq kinna (2) - 282 freq hesna (2) - 12 freq kunna (2) - 1 freq |
kensna (0) - 2 freq kentna (2) - 12 freq kenna (2) - 11 freq kens (3) - 533 freq kenan (3) - 3 freq kinna (3) - 282 freq kennan (3) - 14 freq kenny (3) - 46 freq ken-no (3) - 1 freq ken-nae (3) - 3 freq kenin (3) - 2 freq kunna (3) - 1 freq kennae (3) - 1 freq kanna (3) - 1 freq kensho (3) - 1 freq kensit (3) - 1 freq ken-an (4) - 3 freq kaenin (4) - 2 freq kesson (4) - 2 freq kinset (4) - 1 freq kennen (4) - 2 freq kins (4) - 15 freq kannae (4) - 1 freq kanin (4) - 1 freq kinn (4) - 4 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 - KNSN kensna - 2 freq goins-on - 1 freq consign - 1 freq gauins-on - 1 freq |
KENSNA |
Time to execute Levenshtein function - 0.261849 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.378058 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.029202 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.037724 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.000832 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. |