| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kecklin (0) - 11 freq kekklin (1) - 1 freq keckin (1) - 1 freq tecklin (1) - 1 freq hecklin (1) - 1 freq reckin (2) - 5 freq kecklt (2) - 3 freq tacklin (2) - 4 freq fecklie (2) - 2 freq keckles (2) - 2 freq kennlin (2) - 5 freq bucklin (2) - 7 freq kickin (2) - 65 freq picklin (2) - 2 freq keckled (2) - 11 freq deckin (2) - 2 freq peckin (2) - 16 freq keckle (2) - 8 freq kendlin (2) - 1 freq kettlin (2) - 3 freq keelin (2) - 1 freq crecklin (2) - 1 freq declin (2) - 1 freq ticklin (2) - 6 freq keekin (2) - 126 freq |
kecklin (0) - 11 freq tecklin (2) - 1 freq hecklin (2) - 1 freq keckin (2) - 1 freq kekklin (2) - 1 freq cacklin (3) - 2 freq ticklin (3) - 6 freq keechlin (3) - 2 freq neckline (3) - 1 freq knucklin (3) - 1 freq racklin (3) - 3 freq keckle (3) - 8 freq hucklin (3) - 2 freq sucklin (3) - 1 freq keckled (3) - 11 freq keckles (3) - 2 freq tacklin (3) - 4 freq kecklt (3) - 3 freq bucklin (3) - 7 freq kickin (3) - 65 freq picklin (3) - 2 freq keckit (4) - 1 freq caiklin (4) - 1 freq keckilt (4) - 1 freq kickan (4) - 2 freq |
SoundEx code - K245 kecklin - 11 freq keechlin - 2 freq kekklin - 1 freq |
MetaPhone code - KKLN kecklin - 11 freq cacklin - 2 freq cooglin - 1 freq coaglin - 1 freq googlin - 7 freq cacklan - 1 freq caiklin - 1 freq kekklin - 1 freq |
KECKLIN |
| Time to execute Levenshtein function - 0.191977 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.368072 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.027920 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.037951 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.000899 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. |