| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kinlin (0) - 2 freq kindlin (1) - 5 freq kitlin (1) - 4 freq killin (1) - 61 freq kinnlin (1) - 10 freq kinkin (1) - 3 freq tinlin (1) - 1 freq ainlie (2) - 116 freq ilin (2) - 1 freq dwinlin (2) - 2 freq binlid (2) - 1 freq tinglin (2) - 7 freq mingin (2) - 101 freq kiln (2) - 7 freq hidlin (2) - 1 freq dunlin (2) - 2 freq kinrik (2) - 37 freq kindon (2) - 1 freq mincin (2) - 2 freq kanin (2) - 1 freq killan (2) - 2 freq ailin (2) - 2 freq ainin (2) - 1 freq tillin (2) - 3 freq sinkin (2) - 25 freq |
kinlin (0) - 2 freq kunlun (2) - 4 freq kinleen (2) - 1 freq kinkin (2) - 3 freq tinlin (2) - 1 freq kindlin (2) - 5 freq kinnlin (2) - 10 freq kitlin (2) - 4 freq killin (2) - 61 freq kinnen (3) - 4 freq kullin (3) - 1 freq killen (3) - 4 freq kynlie (3) - 3 freq inlan (3) - 1 freq kendlin (3) - 1 freq kinelie (3) - 1 freq kinnon (3) - 12 freq kennlin (3) - 5 freq finlan (3) - 1 freq conlin (3) - 5 freq keelin (3) - 1 freq kennin (3) - 296 freq kenin (3) - 2 freq killan (3) - 2 freq kiln (3) - 7 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 |
KINLIN |
| Time to execute Levenshtein function - 0.196125 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.366024 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.026960 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.036631 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.000826 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. |