| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hazel (0) - 51 freq haze (1) - 19 freq hanzel (1) - 1 freq hazer (1) - 1 freq hael (1) - 9 freq hazelr (1) - 7 freq hazll (1) - 1 freq hazels (1) - 2 freq hae (2) - 8019 freq haven (2) - 19 freq wael (2) - 9 freq haels (2) - 1 freq heel (2) - 35 freq nael (2) - 2 freq have (2) - 1198 freq patel (2) - 1 freq shael (2) - 8 freq haelt (2) - 3 freq hisel (2) - 18 freq hates (2) - 35 freq pael (2) - 2 freq hales (2) - 1 freq haley (2) - 1 freq ael (2) - 1 freq hotel (2) - 91 freq |
hazel (0) - 51 freq hazll (2) - 1 freq hazle (2) - 1 freq hazily (2) - 1 freq hazelr (2) - 7 freq hazels (2) - 2 freq hael (2) - 9 freq haze (2) - 19 freq hazer (2) - 1 freq hanzel (2) - 1 freq haunel (3) - 3 freq haill (3) - 411 freq hail (3) - 259 freq hazy (3) - 13 freq azl (3) - 1 freq hegel (3) - 2 freq hize (3) - 11 freq hall (3) - 180 freq halely (3) - 7 freq heaze (3) - 1 freq hal (3) - 4 freq haaal (3) - 1 freq hizsel (3) - 1 freq haall (3) - 11 freq hyze (3) - 2 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 |
HAZEL |
| Time to execute Levenshtein function - 0.397071 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.765469 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.027816 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.085379 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.000850 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. |