| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| huckle (0) - 11 freq heckle (1) - 2 freq huckled (1) - 12 freq chuckle (1) - 12 freq uckle (1) - 1 freq muckle (1) - 2854 freq puckle (1) - 316 freq huckles (1) - 1 freq buckle (1) - 12 freq ruckle (1) - 2 freq hurkle (1) - 1 freq tackle (2) - 30 freq pickle (2) - 30 freq tickle (2) - 13 freq hurple (2) - 1 freq hankle (2) - 1 freq hunkled (2) - 1 freq 'muckle (2) - 2 freq mickle (2) - 13 freq packle (2) - 1 freq pucklie (2) - 35 freq feckle (2) - 2 freq hurtle (2) - 3 freq hucklin (2) - 2 freq hackie (2) - 4 freq |
huckle (0) - 11 freq heckle (1) - 2 freq huckles (2) - 1 freq buckle (2) - 12 freq hurkle (2) - 1 freq puckle (2) - 316 freq ruckle (2) - 2 freq muckle (2) - 2854 freq huckled (2) - 12 freq chuckle (2) - 12 freq uckle (2) - 1 freq huckelt (3) - 2 freq shackle (3) - 2 freq chickle (3) - 1 freq mucklie (3) - 1 freq hackles (3) - 3 freq sickle (3) - 4 freq mueckle (3) - 2 freq fickle (3) - 11 freq keckle (3) - 8 freq cockle (3) - 4 freq hechle (3) - 1 freq sheckle (3) - 1 freq pockle (3) - 1 freq hacklet (3) - 1 freq |
SoundEx code - H240 hazel - 51 freq hissel - 371 freq huckle - 11 freq highly - 17 freq hassle - 24 freq hisel - 18 freq hisel' - 1 freq his-sel - 3 freq hessel - 9 freq hizsel - 1 freq heezsel - 1 freq hissell - 55 freq hisell - 2 freq hazily - 1 freq hizzle - 3 freq hoose'll - 2 freq hïssel - 33 freq hazll - 1 freq heckle - 2 freq heighly - 1 freq haakhill - 1 freq haigle - 1 freq hegel - 2 freq hushle - 1 freq hizzel - 1 freq heichlie - 2 freq hugely - 4 freq €˜highly - 1 freq howasley - 1 freq hazle - 1 freq hechle - 1 freq hecla - 4 freq hhgqul - 1 freq |
MetaPhone code - HKL huckle - 11 freq heckle - 2 freq haigle - 1 freq hecla - 4 freq |
HUCKLE |
| Time to execute Levenshtein function - 0.180545 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.353590 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.032465 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.039883 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.000931 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. |