| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kneelin (0) - 19 freq keelin (1) - 1 freq kneeling (1) - 1 freq kneedin (1) - 1 freq kweelin (1) - 1 freq kneadin (2) - 1 freq needin (2) - 211 freq heelin (2) - 1 freq kneels (2) - 1 freq keelie (2) - 7 freq kneelt (2) - 3 freq tweelin (2) - 2 freq creelin (2) - 2 freq peelin (2) - 5 freq wheelin (2) - 12 freq reelin (2) - 16 freq queelin (2) - 1 freq sneevlin (2) - 2 freq speelin (2) - 5 freq unfeelin (2) - 2 freq jeelin (2) - 5 freq sneexin (2) - 1 freq keelit (2) - 1 freq cweelin (2) - 1 freq kneeled (2) - 3 freq |
kneelin (0) - 19 freq kneedin (2) - 1 freq kweelin (2) - 1 freq kneeling (2) - 1 freq keelin (2) - 1 freq keenin (3) - 10 freq kneeld (3) - 1 freq kneel (3) - 15 freq knelit (3) - 1 freq kneeled (3) - 3 freq kinlin (3) - 2 freq kneadin (3) - 1 freq kneels (3) - 1 freq kneelt (3) - 3 freq keneen (4) - 2 freq kindlin (4) - 5 freq kunlun (4) - 4 freq kitlin (4) - 4 freq nailin (4) - 1 freq kendlin (4) - 1 freq klein (4) - 5 freq knypin (4) - 4 freq kennlin (4) - 5 freq snailin (4) - 1 freq snuilin (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 - NLN kneelin - 19 freq nailin - 1 freq nylon - 4 freq |
KNEELIN |
| Time to execute Levenshtein function - 0.222588 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.365515 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.030155 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.044169 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.000839 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. |