| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heckle (0) - 2 freq teckle (1) - 5 freq heckled (1) - 1 freq feckle (1) - 2 freq hechle (1) - 1 freq huckle (1) - 11 freq keckle (1) - 8 freq sheckle (1) - 1 freq teckled (2) - 1 freq tickle (2) - 12 freq mickle (2) - 13 freq pockle (2) - 1 freq helle (2) - 6 freq meikle (2) - 4 freq chickle (2) - 1 freq fickle (2) - 11 freq mueckle (2) - 2 freq wechle (2) - 1 freq uckle (2) - 1 freq hurkle (2) - 1 freq sickle (2) - 3 freq hecklin (2) - 1 freq heck (2) - 12 freq hacklet (2) - 1 freq pickle (2) - 30 freq |
heckle (0) - 2 freq huckle (1) - 11 freq heckled (2) - 1 freq sheckle (2) - 1 freq teckle (2) - 5 freq keckle (2) - 8 freq hechle (2) - 1 freq feckle (2) - 2 freq cockle (3) - 4 freq chuckle (3) - 11 freq muckle (3) - 2838 freq packle (3) - 1 freq leckly (3) - 2 freq cackle (3) - 7 freq heckelt (3) - 1 freq hickled (3) - 1 freq shackle (3) - 1 freq fecklie (3) - 2 freq tackle (3) - 30 freq hecky (3) - 14 freq huckles (3) - 1 freq rickle (3) - 31 freq hackles (3) - 3 freq hankle (3) - 1 freq hecla (3) - 4 freq |
SoundEx code - H240 hazel - 51 freq hissel - 371 freq huckle - 11 freq highly - 17 freq hassle - 20 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 |
HECKLE |
| Time to execute Levenshtein function - 0.488069 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 - 1.078448 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.029266 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.091224 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.000799 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. |