Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kinrike (0) - 1 freq kinrik (1) - 37 freq kinriks (1) - 2 freq sinrise (2) - 1 freq kinglike (2) - 1 freq kinrick (2) - 22 freq kirrie (2) - 1 freq kinnik (2) - 1 freq kingie (2) - 1 freq kingriks (2) - 1 freq kin-like (2) - 1 freq kintrie (2) - 37 freq kinricks (2) - 1 freq k'nie (3) - 1 freq kiæie (3) - 1 freq kirtle (3) - 2 freq kishie (3) - 12 freq incite (3) - 1 freq sunrise (3) - 14 freq minite (3) - 1 freq kindle (3) - 4 freq firie (3) - 1 freq kinnilt (3) - 1 freq katrine (3) - 3 freq knife (3) - 102 freq |
kinrike (0) - 1 freq kinrik (1) - 37 freq kinriks (2) - 2 freq kinrick (3) - 22 freq kinnik (3) - 1 freq kynryk (3) - 1 freq kinred (4) - 2 freq kirko (4) - 2 freq lanrik (4) - 2 freq kink (4) - 8 freq kinky (4) - 1 freq knark (4) - 1 freq kirk (4) - 528 freq kirky (4) - 12 freq keingryke (4) - 5 freq kinricks (4) - 1 freq kin-like (4) - 1 freq kirrie (4) - 1 freq kintrie (4) - 37 freq kingriks (4) - 1 freq kinglike (4) - 1 freq kingie (4) - 1 freq sinrise (4) - 1 freq kerrie (5) - 1 freq linkie (5) - 3 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 |
KINRIKE |
Time to execute Levenshtein function - 0.191188 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.361981 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.027288 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.037408 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.000818 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. |