| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knuckles (0) - 29 freq knuckle (1) - 5 freq kuckles (1) - 1 freq knuckled (1) - 4 freq huckles (2) - 1 freq puckles (2) - 14 freq knucklin (2) - 1 freq ruckles (2) - 1 freq keckles (2) - 2 freq buckles (2) - 1 freq chuckles (2) - 1 freq muckles (2) - 1 freq knackers (3) - 2 freq freckles (3) - 17 freq chuckle (3) - 11 freq hauchles (3) - 1 freq prickles (3) - 2 freq trickles (3) - 3 freq cockles (3) - 6 freq chuckies (3) - 25 freq luckies (3) - 1 freq knocket (3) - 1 freq crunkles (3) - 1 freq buckies (3) - 11 freq fickles (3) - 1 freq |
knuckles (0) - 29 freq kuckles (2) - 1 freq knuckled (2) - 4 freq knuckle (2) - 5 freq knucklin (3) - 1 freq keckles (3) - 2 freq knockers (4) - 2 freq knocks (4) - 14 freq knickers (4) - 42 freq knackers (4) - 2 freq knock's (4) - 1 freq fanckles (4) - 1 freq buckles (4) - 1 freq chuckles (4) - 1 freq huckles (4) - 1 freq ruckles (4) - 1 freq muckles (4) - 1 freq puckles (4) - 14 freq tickles (5) - 5 freq keckled (5) - 11 freq arbuckles (5) - 1 freq rickles (5) - 3 freq speckles (5) - 1 freq uncles (5) - 19 freq pirckles (5) - 1 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 - NKLS knuckles - 29 freq necklace - 27 freq niklaus - 1 freq nicola's - 16 freq nicolas - 1 freq nicklaus - 1 freq nicol's - 2 freq nogoals - 1 freq nicoles - 1 freq nicolas - 1 freq |
KNUCKLES |
| Time to execute Levenshtein function - 0.213740 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.360259 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.027289 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.037769 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.000808 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. |