| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hazle (0) - 1 freq halle (1) - 3 freq hazll (1) - 1 freq hanle (1) - 4 freq haze (1) - 20 freq hale (1) - 965 freq hauls (2) - 1 freq able (2) - 436 freq helle (2) - 6 freq haare (2) - 1 freq dale (2) - 29 freq eaze (2) - 1 freq hail- (2) - 1 freq hallo (2) - 5 freq haaled (2) - 21 freq dazler (2) - 2 freq hance (2) - 2 freq hause (2) - 25 freq hare (2) - 199 freq harse (2) - 1 freq hauld (2) - 17 freq haals (2) - 9 freq fable (2) - 8 freq shale (2) - 6 freq httle (2) - 1 freq |
hazle (0) - 1 freq hale (2) - 965 freq hazel (2) - 51 freq haze (2) - 20 freq hazily (2) - 1 freq halle (2) - 3 freq hanle (2) - 4 freq hazll (2) - 1 freq hayley (3) - 2 freq azl (3) - 1 freq hazels (3) - 2 freq hizzle (3) - 3 freq hawl (3) - 1 freq aizle (3) - 1 freq hize (3) - 11 freq hallie (3) - 1 freq haall (3) - 11 freq hle (3) - 1 freq halo (3) - 10 freq hayl (3) - 2 freq hailie (3) - 10 freq hazy (3) - 13 freq habile (3) - 6 freq hazelr (3) - 7 freq heile (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 - HSL hazel - 51 freq hissel - 371 freq hassle - 24 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 |
HAZLE |
| Time to execute Levenshtein function - 0.398527 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.671494 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.028288 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.076621 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.000857 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. |