| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hisel (0) - 18 freq hisel' (1) - 1 freq hinsel (1) - 1 freq hidsel (1) - 7 freq hissel (1) - 371 freq hizsel (1) - 1 freq hitsel (1) - 13 freq chisel (1) - 9 freq hirsel (1) - 119 freq eisel (1) - 1 freq hisell (1) - 2 freq misel (1) - 14 freq himsel (1) - 852 freq hie (2) - 113 freq hiely (2) - 1 freq €™sel (2) - 3 freq histy (2) - 1 freq hissy (2) - 3 freq mysel (2) - 131 freq yised (2) - 4 freq wised (2) - 1 freq his't (2) - 1 freq hied (2) - 16 freq shivel (2) - 1 freq hired (2) - 27 freq |
hisel (0) - 18 freq hirsel (2) - 119 freq eisel (2) - 1 freq himsel (2) - 852 freq chisel (2) - 9 freq hisell (2) - 2 freq misel (2) - 14 freq hitsel (2) - 13 freq hisel' (2) - 1 freq hidsel (2) - 7 freq hinsel (2) - 1 freq hizsel (2) - 1 freq hissel (2) - 371 freq ousel (3) - 1 freq heel (3) - 35 freq hursel (3) - 14 freq issel (3) - 1 freq ursel (3) - 2 freq thysel (3) - 1 freq hish (3) - 1 freq hoses (3) - 1 freq irsel (3) - 2 freq itsel (3) - 466 freq hessel (3) - 9 freq hill (3) - 461 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 |
HISEL |
| Time to execute Levenshtein function - 0.174163 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.349871 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.027324 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.036564 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.000789 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. |