| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kennlin (0) - 5 freq kinnlin (1) - 10 freq kennin (1) - 297 freq kendlin (1) - 1 freq kettlin (2) - 3 freq ennin (2) - 2 freq dinnlin (2) - 2 freq kennled (2) - 2 freq kennins (2) - 6 freq kenin (2) - 2 freq kennie (2) - 1 freq kennen (2) - 2 freq kecklin (2) - 11 freq rennin (2) - 6 freq kekklin (2) - 1 freq kinlin (2) - 2 freq keenin (2) - 10 freq kennin' (2) - 1 freq hannlin (2) - 26 freq kindlin (2) - 5 freq sennin (2) - 12 freq pennin (2) - 2 freq fennin (2) - 53 freq lennin (2) - 2 freq kennit (2) - 1 freq |
kennlin (0) - 5 freq kinnlin (1) - 10 freq kendlin (2) - 1 freq kennin (2) - 297 freq kennen (3) - 2 freq kinlin (3) - 2 freq kindlin (3) - 5 freq hannlin (3) - 26 freq runnlin (3) - 1 freq kennle (3) - 2 freq kennan (3) - 14 freq dinnlin (3) - 2 freq kennled (3) - 2 freq gainnlin (4) - 1 freq pannelin (4) - 1 freq haunnlin (4) - 1 freq mennin (4) - 3 freq kinnlt (4) - 1 freq kennel (4) - 11 freq kneelin (4) - 19 freq kinnle (4) - 3 freq kinnen (4) - 4 freq kunlun (4) - 4 freq kennitna (4) - 1 freq kennels (4) - 5 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 |
KENNLIN |
| Time to execute Levenshtein function - 0.488776 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.800988 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.079671 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.090629 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.001731 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. |