Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
knap (0) - 9 freq knaw (1) - 16 freq kap (1) - 1 freq knas (1) - 1 freq snap (1) - 38 freq knaa (1) - 1 freq gnap (1) - 1 freq nap (1) - 17 freq knapp (1) - 2 freq krap (1) - 1 freq knaps (1) - 4 freq snap- (2) - 2 freq anar (2) - 1 freq knappy (2) - 1 freq kay (2) - 67 freq knit (2) - 17 freq na' (2) - 1 freq anal (2) - 1 freq kaas (2) - 2 freq ona (2) - 14 freq kep (2) - 136 freq krapp (2) - 1 freq kwaz (2) - 1 freq nup (2) - 12 freq klp (2) - 1 freq |
knap (0) - 9 freq nap (2) - 17 freq krap (2) - 1 freq knaps (2) - 4 freq gnap (2) - 1 freq knapp (2) - 2 freq kap (2) - 1 freq knaa (2) - 1 freq knaw (2) - 16 freq knas (2) - 1 freq snap (2) - 38 freq kno (3) - 16 freq kecp (3) - 1 freq nape (3) - 2 freq knee (3) - 126 freq kdp (3) - 1 freq bnp (3) - 1 freq kidnap (3) - 4 freq kaip (3) - 2 freq nip (3) - 119 freq knox (3) - 34 freq knj (3) - 1 freq kneb (3) - 1 freq kelp (3) - 13 freq nop (3) - 1 freq |
SoundEx code - K510 knife - 104 freq knave - 48 freq kinnefa - 1 freq kemp - 46 freq 'knife - 1 freq kempie - 1 freq kempe - 3 freq knapp - 2 freq knob - 12 freq knif - 1 freq knap - 9 freq knappy - 1 freq kneb - 1 freq kinneff - 1 freq knoab - 1 freq knap-hie - 1 freq knabbie - 4 freq kempy - 2 freq kyemp - 1 freq €˜knifey - 1 freq €˜k-nife - 1 freq kumbh - 3 freq kmf - 1 freq kenobi - 1 freq kennef - 1 freq kqmv - 1 freq |
MetaPhone code - NP nup - 12 freq nip - 119 freq neep - 130 freq nippy - 29 freq nappy - 15 freq 'nup - 1 freq noup - 2 freq nape - 2 freq nippie - 6 freq nowp - 1 freq noop - 1 freq knapp - 2 freq knap - 9 freq nop - 1 freq knappy - 1 freq nappie - 1 freq nap - 17 freq gnap - 1 freq nope - 18 freq neep' - 1 freq niep - 2 freq napa - 3 freq nae-pea - 1 freq €œnip - 2 freq €˜nup - 2 freq napp - 2 freq €˜nippy - 3 freq nnpw - 1 freq np - 5 freq neap - 1 freq npu - 1 freq 'nip - 2 freq 'neep' - 3 freq |
KNAP |
Time to execute Levenshtein function - 0.199049 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.383951 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.028691 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.038589 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.000985 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. |