| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knucklin (0) - 1 freq knockin (2) - 42 freq chucklin (2) - 3 freq knuckled (2) - 4 freq sucklin (2) - 1 freq hucklin (2) - 2 freq kecklin (2) - 11 freq knuckle (2) - 5 freq knuckles (2) - 29 freq knackin (2) - 1 freq bucklin (2) - 7 freq wauchlin (3) - 1 freq mauchlin (3) - 13 freq inklin (3) - 22 freq runklin (3) - 1 freq hecklin (3) - 1 freq crunklin (3) - 2 freq tecklin (3) - 1 freq kekklin (3) - 1 freq fuckin (3) - 1018 freq cacklin (3) - 1 freq nutkin (3) - 1 freq snufflin (3) - 4 freq inlklin (3) - 1 freq 'fuckin (3) - 29 freq |
knucklin (0) - 1 freq knuckle (3) - 5 freq knuckles (3) - 29 freq kecklin (3) - 11 freq knackin (3) - 1 freq knockin (3) - 42 freq knuckled (3) - 4 freq knoackin (4) - 4 freq knackerin (4) - 1 freq neckline (4) - 1 freq hucklin (4) - 2 freq bucklin (4) - 7 freq sucklin (4) - 1 freq chucklin (4) - 3 freq knockan (4) - 3 freq chucklan (5) - 1 freq knockin' (5) - 2 freq crecklin (5) - 1 freq snorklin (5) - 1 freq racklin (5) - 3 freq tacklin (5) - 4 freq kickin (5) - 64 freq knockit (5) - 13 freq knackie (5) - 10 freq tricklin (5) - 4 freq |
SoundEx code - K524 knuckles - 29 freq knucklin - 1 freq kingholm - 1 freq knuckle - 5 freq knockahollet - 2 freq kinglassie - 4 freq kinglassiet - 1 freq king'll - 1 freq knuckle-kaimed - 1 freq knuckledusters - 1 freq kingly - 1 freq kensalem - 1 freq knuckled - 4 freq knukkilt - 1 freq kinglike - 1 freq knackie-lyeukin - 1 freq knucklebones - 1 freq koonsuls - 1 freq knuckleheids - 1 freq kungles - 1 freq konkleuzhin - 1 freq kayenicolson - 1 freq kingswells - 4 freq knocklayd - 1 freq kenmccoll - 1 freq kmcalindon - 5 freq kmcall - 4 freq kimnicoll - 2 freq |
MetaPhone code - NKLN knucklin - 1 freq nigglin - 3 freq neckline - 1 freq |
KNUCKLIN |
| Time to execute Levenshtein function - 0.197541 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.353084 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.029793 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.038520 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.000892 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. |