| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kneevlick (0) - 1 freq deevlick (2) - 1 freq neesick (3) - 1 freq kethlick (3) - 1 freq kneeling (3) - 1 freq sneevlin (3) - 2 freq kneelin (3) - 19 freq deevilick (3) - 3 freq angelic (4) - 9 freq interdick (4) - 1 freq neesicks (4) - 1 freq weethick (4) - 1 freq inflick (4) - 1 freq jeemick (4) - 2 freq keelin (4) - 1 freq angelica (4) - 4 freq methlick (4) - 1 freq ceevic (4) - 2 freq negleck (4) - 7 freq sheeptick (4) - 1 freq queerlik (4) - 1 freq teeick (4) - 2 freq kneedin (4) - 1 freq sneevilin (4) - 1 freq kneeld (4) - 1 freq |
kneevlick (0) - 1 freq deevlick (4) - 1 freq kethlick (5) - 1 freq deevilick (5) - 3 freq inflick (6) - 1 freq coenflick (6) - 1 freq kenefick (6) - 1 freq knablich (6) - 1 freq negleck (6) - 7 freq deevilock (6) - 2 freq sneevlin (6) - 2 freq neesick (6) - 1 freq kneelin (6) - 19 freq knick (6) - 2 freq kneeling (6) - 1 freq interlock (7) - 1 freq sneevil (7) - 1 freq kneeled (7) - 3 freq knapseck (7) - 1 freq knapsack (7) - 4 freq knelit (7) - 1 freq convick (7) - 5 freq laevrick (7) - 2 freq unblock (7) - 3 freq unlock (7) - 7 freq |
SoundEx code - K514 knobbly - 4 freq kinfolk - 1 freq kennable - 3 freq kneevlick - 1 freq knablich - 1 freq kenable - 19 freq knobble - 4 freq kenably - 6 freq kimblecheat - 1 freq komplettwayne - 1 freq |
MetaPhone code - NFLK kneevlick - 1 freq |
KNEEVLICK |
| Time to execute Levenshtein function - 0.210197 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.351954 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.027274 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.036669 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.000807 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. |