| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keckles (0) - 2 freq keckle (1) - 8 freq keckled (1) - 11 freq kuckles (1) - 1 freq feckle (2) - 2 freq fickles (2) - 1 freq kecks (2) - 5 freq huckles (2) - 1 freq cackles (2) - 1 freq hecklers (2) - 1 freq feckless (2) - 14 freq speckles (2) - 1 freq teckled (2) - 1 freq kettles (2) - 2 freq buckles (2) - 2 freq tickles (2) - 5 freq teckle (2) - 5 freq cockles (2) - 6 freq tackles (2) - 3 freq kecklin (2) - 11 freq puckles (2) - 14 freq rickles (2) - 4 freq ruckles (2) - 1 freq knuckles (2) - 29 freq pickles (2) - 2 freq |
keckles (0) - 2 freq kuckles (1) - 1 freq keckle (2) - 8 freq keckled (2) - 11 freq rickles (3) - 4 freq puckles (3) - 14 freq ruckles (3) - 1 freq tackles (3) - 3 freq kecklin (3) - 11 freq hackles (3) - 3 freq muckles (3) - 1 freq yackles (3) - 1 freq cockles (3) - 6 freq pickles (3) - 2 freq knuckles (3) - 29 freq kecklt (3) - 3 freq kecks (3) - 5 freq cackles (3) - 1 freq huckles (3) - 1 freq fickles (3) - 1 freq tickles (3) - 5 freq buckles (3) - 2 freq keckilt (4) - 1 freq teckle (4) - 5 freq seckless (4) - 1 freq |
SoundEx code - K242 keckles - 2 freq kuckles - 1 freq kasilas - 1 freq kyxlklp - 1 freq kuklgomcom - 1 freq |
MetaPhone code - KKLS googlies - 1 freq keckles - 2 freq cockles - 6 freq goggles - 10 freq coagles - 1 freq coackles - 1 freq kuckles - 1 freq cackles - 1 freq |
KECKLES |
| Time to execute Levenshtein function - 0.201673 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.422385 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.031579 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.042119 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.001281 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. |