| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knark (0) - 1 freq knack (1) - 12 freq nark (1) - 1 freq wnar (2) - 1 freq knoack (2) - 7 freq knackt (2) - 1 freq 'dark (2) - 1 freq snirk (2) - 1 freq waark (2) - 110 freq karn (2) - 7 freq kare (2) - 1 freq sark (2) - 122 freq narky (2) - 1 freq nare (2) - 1 freq nak (2) - 1 freq yark (2) - 8 freq wark (2) - 892 freq knaa (2) - 1 freq dark (2) - 378 freq snack (2) - 7 freq anar (2) - 1 freq knapp (2) - 2 freq knurl (2) - 2 freq mark (2) - 222 freq snaik (2) - 2 freq |
knark (0) - 1 freq nark (2) - 1 freq knack (2) - 12 freq knock (3) - 111 freq kynryk (3) - 1 freq kirk (3) - 528 freq knorr (3) - 5 freq knick (3) - 2 freq lanark (3) - 29 freq kenmark (3) - 1 freq narky (3) - 1 freq knacky (3) - 3 freq knurl (3) - 2 freq snirk (3) - 1 freq kinrik (3) - 37 freq knoack (3) - 7 freq enack (4) - 1 freq nary (4) - 2 freq lark (4) - 23 freq kirky (4) - 12 freq nar (4) - 15 freq kyard (4) - 3 freq kinrike (4) - 1 freq kbaek (4) - 1 freq bark (4) - 34 freq |
SoundEx code - K562 kinrick - 22 freq kenmairks - 6 freq kenmairk - 2 freq kinrik - 37 freq kenmerk - 4 freq knark - 1 freq kenmarks - 1 freq kynryk - 1 freq kinriks - 2 freq kinrike - 1 freq kinross - 6 freq kinricks - 1 freq kinrick-biggin - 1 freq ken-merk - 1 freq kenmark - 1 freq kinross-shire - 2 freq |
MetaPhone code - NRK nark - 1 freq nearg - 1 freq narky - 1 freq knark - 1 freq nihrc - 1 freq |
KNARK |
| Time to execute Levenshtein function - 0.186113 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.348151 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.028051 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.037888 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.000850 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. |