Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kinrik (0) - 37 freq kinriks (1) - 2 freq kinnik (1) - 1 freq kinrick (1) - 15 freq kinrike (1) - 1 freq kink (2) - 8 freq kingis (2) - 2 freq kingie (2) - 1 freq kirk (2) - 507 freq kinlin (2) - 2 freq kinkin (2) - 3 freq kintrie (2) - 37 freq kynryk (2) - 1 freq kinred (2) - 2 freq lanrik (2) - 1 freq kingrick (2) - 2 freq winrin (2) - 2 freq kingrip (2) - 1 freq kirrie (2) - 1 freq kinricks (2) - 1 freq kindrick (2) - 1 freq dimriv (3) - 3 freq hingit (3) - 18 freq kintra (3) - 248 freq kinnae (3) - 10 freq |
kinrik (0) - 37 freq kinrike (1) - 1 freq kynryk (2) - 1 freq kinrick (2) - 15 freq kinriks (2) - 2 freq kinnik (2) - 1 freq kinred (3) - 2 freq kirk (3) - 507 freq knark (3) - 1 freq kink (3) - 8 freq lanrik (3) - 1 freq knick (4) - 2 freq knack (4) - 12 freq kinky (4) - 1 freq kirky (4) - 12 freq knock (4) - 108 freq kindrick (4) - 1 freq konk (4) - 1 freq kirko (4) - 2 freq kinricks (4) - 1 freq kintrie (4) - 37 freq kingrick (4) - 2 freq kinlin (4) - 2 freq kingie (4) - 1 freq kingis (4) - 2 freq |
SoundEx code - K562 kinrick - 15 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 ken-merk - 1 freq kenmark - 1 freq kinross-shire - 2 freq |
MetaPhone code - KNRK kinrick - 15 freq kinrik - 37 freq connerik - 2 freq kynryk - 1 freq kinrike - 1 freq |
KINRIK |
Time to execute Levenshtein function - 0.197493 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.370970 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.028144 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.038256 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.000953 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. |