| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| himsell (0) - 6 freq himsel' (1) - 4 freq hisell (1) - 2 freq himsel (1) - 852 freq himself (1) - 98 freq hirsell (1) - 13 freq hissell (1) - 55 freq hisel (2) - 18 freq tinsell (2) - 1 freq hisel' (2) - 1 freq dimsels (2) - 1 freq hersell (2) - 12 freq hinsel (2) - 1 freq itsell (2) - 16 freq himsel's (2) - 2 freq idsell (2) - 11 freq yirsell (2) - 1 freq hirsel (2) - 119 freq imsel (2) - 29 freq hitsel (2) - 13 freq hizsel (2) - 1 freq ahimsel (2) - 1 freq thimsels (2) - 2 freq humsel (2) - 3 freq himsael (2) - 4 freq |
himsell (0) - 6 freq hissell (2) - 55 freq hirsell (2) - 13 freq himself (2) - 98 freq himsel' (2) - 4 freq hisell (2) - 2 freq himsel (2) - 852 freq hersell (3) - 12 freq humsel (3) - 3 freq ahimsel (3) - 1 freq himsael (3) - 4 freq hirselt (4) - 1 freq hizself (4) - 1 freq hissel (4) - 371 freq hisself (4) - 3 freq masell (4) - 67 freq mysell (4) - 2 freq heimdall (4) - 3 freq mesell (4) - 2 freq maesell (4) - 1 freq hirsels (4) - 3 freq €™msell (4) - 1 freq hidsel (4) - 7 freq hinsel (4) - 1 freq itsell (4) - 16 freq |
SoundEx code - H524 himself - 98 freq himsel - 852 freq hansel - 16 freq himsel' - 4 freq 'heinkels - 1 freq himsell - 6 freq han-clap - 1 freq himsael - 4 freq hanselt - 3 freq hunkled - 1 freq himsel's - 2 freq hanklet - 2 freq hanzel - 1 freq hansellin - 3 freq hoenselaars - 2 freq hankle - 1 freq humsel - 3 freq hinsel - 1 freq hanselin - 1 freq homygollachs - 1 freq hansels - 3 freq hngylbcxv - 1 freq hing'll - 1 freq haim-schuilt - 1 freq hankelt - 1 freq homeschoolin - 1 freq homeschooling - 1 freq hameschoolin - 1 freq |
MetaPhone code - HMSL himsel - 852 freq himsel' - 4 freq himsell - 6 freq himsael - 4 freq humsel - 3 freq |
HIMSELL |
| Time to execute Levenshtein function - 0.318873 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.490851 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.037143 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.053492 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.001005 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. |