| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kinrick (0) - 22 freq kingrick (1) - 2 freq kinrik (1) - 37 freq kinricks (1) - 1 freq kindrick (1) - 1 freq kangrick (2) - 6 freq henrick (2) - 3 freq kinnik (2) - 1 freq kinriks (2) - 2 freq tirrick (2) - 6 freq lanrick (2) - 1 freq knick (2) - 2 freq inwick (2) - 3 freq kinrike (2) - 1 freq binnock (3) - 1 freq inseck (3) - 1 freq kenefick (3) - 1 freq winnock (3) - 23 freq rick (3) - 4 freq kinnilt (3) - 1 freq kintrie (3) - 37 freq cantick (3) - 1 freq willick (3) - 2 freq kingrip (3) - 1 freq kinross (3) - 6 freq |
kinrick (0) - 22 freq kindrick (2) - 1 freq kinricks (2) - 1 freq kinrik (2) - 37 freq kingrick (2) - 2 freq lanrick (3) - 1 freq kinrike (3) - 1 freq knick (3) - 2 freq henrick (3) - 3 freq kangrick (3) - 6 freq kynryk (4) - 1 freq knoack (4) - 7 freq knock (4) - 113 freq knack (4) - 12 freq kenefick (4) - 1 freq kinriks (4) - 2 freq kinnik (4) - 1 freq inwick (4) - 3 freq tirrick (4) - 6 freq direck (5) - 30 freq kirk (5) - 530 freq heinrich (5) - 3 freq renwick (5) - 18 freq kinfowk (5) - 1 freq enric (5) - 1 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 - KNRK kinrick - 22 freq kinrik - 37 freq connerik - 2 freq kynryk - 1 freq kinrike - 1 freq |
KINRICK |
| Time to execute Levenshtein function - 0.176812 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.313443 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.028245 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.037002 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.000892 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. |