Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kentna (0) - 12 freq tentna (1) - 2 freq kenna (1) - 11 freq kensna (1) - 2 freq kanna (2) - 1 freq kintra (2) - 248 freq kenny (2) - 46 freq kennitna (2) - 1 freq ceptna (2) - 2 freq jenna (2) - 5 freq kinna (2) - 273 freq mintna (2) - 1 freq kunna (2) - 1 freq ken-nae (2) - 3 freq wenna (2) - 1 freq henna (2) - 2 freq lenna (2) - 1 freq kennan (2) - 14 freq kennt (2) - 144 freq kent's (2) - 2 freq kenya (2) - 6 freq kent (2) - 1786 freq ken-no (2) - 1 freq kenin (2) - 2 freq teltna (2) - 1 freq |
kentna (0) - 12 freq kenna (2) - 11 freq kensna (2) - 2 freq tentna (2) - 2 freq kennae (3) - 1 freq kennan (3) - 14 freq ken-nae (3) - 3 freq kenan (3) - 3 freq ken-no (3) - 1 freq kenin (3) - 2 freq kunna (3) - 1 freq kent (3) - 1786 freq mintna (3) - 1 freq kinna (3) - 273 freq kennitna (3) - 1 freq kenny (3) - 46 freq kintra (3) - 248 freq kanna (3) - 1 freq ktn (4) - 1 freq ken'an (4) - 1 freq kennin (4) - 281 freq kaenin (4) - 2 freq kint (4) - 38 freq renton (4) - 4 freq kertan (4) - 1 freq |
SoundEx code - K535 kindness - 45 freq knittin - 25 freq kentna - 12 freq knittan - 3 freq kindness's - 2 freq knitteen - 5 freq kennitna - 1 freq knitting - 8 freq kneedin - 1 freq komduweeme - 1 freq knottin - 1 freq knittin' - 1 freq kyndnes - 1 freq knittins - 1 freq kneadin - 1 freq kyndness - 1 freq kmdnbv - 1 freq kennethmont - 2 freq kindon - 1 freq kuantancurls - 5 freq kqmtnt - 1 freq |
MetaPhone code - KNTN continue - 69 freq countin - 13 freq gauntin - 2 freq gantin - 22 freq coontin - 45 freq contain - 11 freq kentna - 12 freq cuntin - 1 freq canteen - 19 freq 'continue - 1 freq condone - 1 freq canton - 2 freq quentin - 6 freq coundna - 1 freq canadian - 5 freq coontan - 3 freq kennitna - 1 freq quintin - 1 freq conteen - 2 freq countan - 1 freq conteenue - 2 freq cantin - 4 freq canadiane - 2 freq conteena - 3 freq continua - 1 freq contenna - 1 freq kindon - 1 freq |
KENTNA |
Time to execute Levenshtein function - 0.172732 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.316700 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.027379 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.037398 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.001008 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. |