Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hidsel (0) - 7 freq hitsel (1) - 13 freq idsel (1) - 3 freq himsel (1) - 852 freq hissel (1) - 371 freq hinsel (1) - 1 freq hizsel (1) - 1 freq hisel (1) - 18 freq hirsel (1) - 119 freq hansel (2) - 16 freq harsel (2) - 1 freq issel (2) - 1 freq hizzel (2) - 1 freq hisself (2) - 3 freq hidey (2) - 2 freq imsel (2) - 29 freq missel (2) - 1 freq hersel (2) - 1057 freq thirsel (2) - 5 freq himsel' (2) - 4 freq hisses (2) - 3 freq chisel (2) - 9 freq himsell (2) - 6 freq midse (2) - 1 freq hissell (2) - 55 freq |
hidsel (0) - 7 freq hizsel (2) - 1 freq hirsel (2) - 119 freq hinsel (2) - 1 freq hisel (2) - 18 freq hissel (2) - 371 freq idsel (2) - 3 freq hitsel (2) - 13 freq himsel (2) - 852 freq humsel (3) - 3 freq handsel (3) - 7 freq hiddil (3) - 2 freq hid'il (3) - 1 freq diesel (3) - 6 freq himsael (3) - 4 freq hids (3) - 86 freq hid'l (3) - 1 freq ahimsel (3) - 1 freq hursel (3) - 14 freq hides (3) - 14 freq hessel (3) - 9 freq hetsel (3) - 1 freq harsel (3) - 1 freq hansel (3) - 16 freq hersel (3) - 1057 freq |
SoundEx code - H324 hetsel - 1 freq hidsel - 7 freq hitsel - 13 freq headcollar - 1 freq hatchlings - 1 freq |
MetaPhone code - HTSL hetsel - 1 freq hidsel - 7 freq hitsel - 13 freq |
HIDSEL |
Time to execute Levenshtein function - 0.209564 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.368981 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.026963 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.037226 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.000839 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. |