| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hassle (0) - 20 freq cassle (1) - 1 freq fissle (2) - 3 freq halse (2) - 1 freq hause (2) - 25 freq haase (2) - 2 freq jassie (2) - 3 freq chasse (2) - 2 freq hashie (2) - 2 freq harse (2) - 1 freq whussle (2) - 3 freq lassve (2) - 1 freq hesse (2) - 1 freq habble (2) - 2 freq hantle (2) - 115 freq hankle (2) - 1 freq hasnae (2) - 41 freq warsle (2) - 24 freq haste (2) - 37 freq haunle (2) - 26 freq fussle (2) - 8 freq hannle (2) - 5 freq hassan (2) - 1 freq tassie (2) - 35 freq wrassle (2) - 1 freq |
hassle (0) - 20 freq cassle (2) - 1 freq hossie (3) - 1 freq hass (3) - 2 freq hesse (3) - 1 freq hessel (3) - 9 freq hassan (3) - 1 freq hissel (3) - 371 freq whussle (3) - 3 freq hussie (3) - 1 freq hasslin (3) - 1 freq fussle (3) - 8 freq hushle (3) - 1 freq hirsle (3) - 3 freq fissle (3) - 3 freq hustle (3) - 1 freq ssl (4) - 1 freq hissell (4) - 55 freq missile (4) - 6 freq hissin (4) - 10 freq hisel (4) - 18 freq handle (4) - 36 freq castle (4) - 153 freq hasthe (4) - 1 freq hisses (4) - 3 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 - HSL hazel - 51 freq hissel - 371 freq hassle - 20 freq hisel - 18 freq hisel' - 1 freq hessel - 9 freq hissell - 55 freq hisell - 2 freq hazily - 1 freq hizzle - 3 freq hoose'll - 2 freq hazll - 1 freq hizzel - 1 freq hazle - 1 freq |
HASSLE |
| Time to execute Levenshtein function - 0.185813 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.320299 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.027737 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.036251 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.000843 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. |