Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kinnlin (0) - 10 freq kennlin (1) - 5 freq dinnlin (1) - 2 freq kindlin (1) - 5 freq kinlin (1) - 2 freq kipplin (2) - 1 freq kennin (2) - 296 freq kirnin (2) - 5 freq runnlin (2) - 1 freq kinkin (2) - 3 freq kinnoir (2) - 3 freq trinnlin (2) - 2 freq tinklin (2) - 4 freq finndin (2) - 11 freq kinnlt (2) - 1 freq jinglin (2) - 11 freq winnin (2) - 88 freq sinnin (2) - 2 freq inclin (2) - 1 freq pinnin (2) - 4 freq singlin (2) - 1 freq pinklin (2) - 2 freq pinntin (2) - 2 freq kittlin (2) - 59 freq kinelie (2) - 1 freq |
kinnlin (0) - 10 freq kennlin (1) - 5 freq kindlin (2) - 5 freq kinlin (2) - 2 freq dinnlin (2) - 2 freq kinnen (3) - 4 freq kinnon (3) - 12 freq kendlin (3) - 1 freq gainnlin (3) - 1 freq kinnlt (3) - 1 freq kinnle (3) - 3 freq hannlin (3) - 26 freq rekinnlin (3) - 1 freq runnlin (3) - 1 freq kennin (3) - 296 freq dwinnlin (4) - 2 freq kitlin (4) - 4 freq tinlin (4) - 1 freq kinnik (4) - 1 freq tinglin (4) - 7 freq kirnin (4) - 5 freq rinklin (4) - 3 freq skinklin (4) - 32 freq linnin (4) - 2 freq kennle (4) - 2 freq |
SoundEx code - K545 kneelin - 19 freq kinlin - 2 freq knee-lenth - 1 freq kneeling - 1 freq kennlin - 5 freq kinnlin - 10 freq knee-length - 2 freq kinleen - 1 freq kunlun - 4 freq kin-walin - 1 freq kïnnlin - 1 freq kumlieni - 1 freq |
MetaPhone code - KNLN kinlin - 2 freq kennlin - 5 freq kinnlin - 10 freq kinleen - 1 freq kunlun - 4 freq kïnnlin - 1 freq gainnlin - 1 freq conlin - 5 freq conlon - 1 freq |
KINNLIN |
Time to execute Levenshtein function - 0.183987 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.378647 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.027608 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.038307 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.000897 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. |