| 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 pinntin (2) - 2 freq pinnin (2) - 4 freq kipplin (2) - 1 freq kittlin (2) - 59 freq skinnin (2) - 3 freq killin (2) - 61 freq kïnnlin (2) - 1 freq tinnin (2) - 1 freq kinnlt (2) - 1 freq runnlin (2) - 1 freq winnin (2) - 90 freq jinglin (2) - 11 freq dwinnlin (2) - 2 freq rinnin (2) - 331 freq tinglin (2) - 7 freq hinnyin (2) - 1 freq kinnon (2) - 12 freq trinnlin (2) - 2 freq gainnlin (2) - 1 freq skinklin (2) - 32 freq |
kinnlin (0) - 10 freq kennlin (1) - 5 freq kinlin (2) - 2 freq kindlin (2) - 5 freq dinnlin (2) - 2 freq hannlin (3) - 26 freq runnlin (3) - 1 freq kennin (3) - 297 freq kinnon (3) - 12 freq kinnlt (3) - 1 freq kinnen (3) - 4 freq kendlin (3) - 1 freq kinnle (3) - 3 freq gainnlin (3) - 1 freq rekinnlin (3) - 1 freq sinnin (4) - 2 freq pinklin (4) - 2 freq kinelie (4) - 1 freq kinnoir (4) - 3 freq singlin (4) - 1 freq pinglin (4) - 1 freq innin (4) - 34 freq kinleen (4) - 1 freq kindleen (4) - 1 freq haunnlin (4) - 1 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.205830 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.356020 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.027901 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.038856 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.000861 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. |