Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hitsel (0) - 13 freq hetsel (1) - 1 freq hissel (1) - 371 freq hidsel (1) - 7 freq itsel (1) - 476 freq hirsel (1) - 119 freq himsel (1) - 863 freq hisel (1) - 18 freq hinsel (1) - 1 freq hizsel (1) - 1 freq yirsel (2) - 89 freq hisses (2) - 4 freq itsel' (2) - 3 freq himsael (2) - 4 freq hits (2) - 150 freq hursel (2) - 16 freq hissen (2) - 1 freq hither (2) - 6 freq hotses (2) - 1 freq hessel (2) - 9 freq itself (2) - 23 freq ainsel (2) - 2 freq diesel (2) - 6 freq issel (2) - 1 freq ahimsel (2) - 1 freq |
hitsel (0) - 13 freq hetsel (1) - 1 freq hisel (2) - 18 freq himsel (2) - 863 freq hizsel (2) - 1 freq hinsel (2) - 1 freq hirsel (2) - 119 freq hissel (2) - 371 freq hidsel (2) - 7 freq itsel (2) - 476 freq hotel (3) - 99 freq hessel (3) - 9 freq humsel (3) - 3 freq hersel (3) - 1059 freq hotses (3) - 1 freq hansel (3) - 16 freq harsel (3) - 1 freq itsael (3) - 1 freq ahimsel (3) - 1 freq hursel (3) - 16 freq himsael (3) - 4 freq hits (3) - 150 freq httle (4) - 1 freq hisell (4) - 2 freq hit'll (4) - 14 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 |
HITSEL itsel - 476 freq itself - 23 freq itsell - 16 freq hitsel - 13 freq |
Time to execute Levenshtein function - 0.185171 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.348368 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.027643 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.039835 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.000906 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. |