Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
knuckledusters (0) - 1 freq knucklebones (5) - 1 freq knuckleheids (6) - 1 freq auldsters (6) - 2 freq knuckled (6) - 4 freq ocklester (6) - 1 freq knuckles (6) - 29 freq clusters (6) - 4 freq mucklegubber's (6) - 1 freq mucklegubber (6) - 2 freq stooriedusters (6) - 1 freq knackers (7) - 2 freq chulemaster (7) - 1 freq jouksters (7) - 5 freq recklessness (7) - 2 freq knickers (7) - 42 freq dusters (7) - 3 freq ancestirs (7) - 1 freq kuckles (7) - 1 freq knockemstiff (7) - 1 freq blockbuster (7) - 1 freq sclenters (7) - 1 freq bleesters (7) - 1 freq mucklewrath's (7) - 1 freq flusters (7) - 1 freq |
knuckledusters (0) - 1 freq knucklebones (9) - 1 freq clusters (10) - 4 freq ocklester (10) - 1 freq knuckles (10) - 29 freq knuckled (10) - 4 freq auldsters (10) - 2 freq knuckleheids (10) - 1 freq knockemstiff (11) - 1 freq knockers (11) - 2 freq ancestors (11) - 54 freq ancestirs (11) - 1 freq scuilmaisters (11) - 1 freq knickers (11) - 42 freq stooriedusters (11) - 1 freq knackers (11) - 2 freq newskesters (12) - 1 freq cluster (12) - 5 freq balusters (12) - 1 freq knackiness (12) - 2 freq knuckle-kaimed (12) - 1 freq nickeledon's (12) - 1 freq bruckleness (12) - 1 freq blousters (12) - 1 freq kickstart (12) - 2 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 - NKLTSTRS knuckledusters - 1 freq |
KNUCKLEDUSTERS |
Time to execute Levenshtein function - 0.277767 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.444775 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.038412 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.040049 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.000829 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. |