| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hizzel (0) - 1 freq hizsel (1) - 1 freq fizzer (2) - 6 freq hitsel (2) - 13 freq hanzel (2) - 1 freq kizzen (2) - 10 freq hazel (2) - 51 freq hizzy (2) - 6 freq jizzen (2) - 4 freq himsel (2) - 852 freq hizself (2) - 1 freq hizzle (2) - 3 freq hidsel (2) - 7 freq bizzed (2) - 3 freq pizzen (2) - 2 freq hizzies (2) - 4 freq hinsel (2) - 1 freq mizzelt (2) - 1 freq gizzen (2) - 5 freq hissel (2) - 371 freq mizzer (2) - 4 freq sizzen (2) - 3 freq hizzie (2) - 5 freq hirsel (2) - 119 freq whizzes (2) - 1 freq |
hizzel (0) - 1 freq hizzle (2) - 3 freq hizsel (2) - 1 freq hizzy (3) - 6 freq hizzie (3) - 5 freq hazel (3) - 51 freq hizzies (3) - 4 freq hanzel (3) - 1 freq hazle (4) - 1 freq sizzed (4) - 1 freq hisel (4) - 18 freq frizzel (4) - 13 freq whizzed (4) - 4 freq bizzen (4) - 2 freq wizzen (4) - 4 freq mizzly (4) - 1 freq fizzed (4) - 1 freq whizzly (4) - 1 freq sizzle (4) - 1 freq fizzle (4) - 1 freq hazll (4) - 1 freq zzl (4) - 1 freq mizzle (4) - 8 freq heezsel (4) - 1 freq dizzen (4) - 85 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 |
HIZZEL |
| Time to execute Levenshtein function - 0.250527 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.324962 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.027408 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.036856 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.000849 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. |