| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| himself (0) - 99 freq himsell (1) - 14 freq hizself (1) - 1 freq himsel (1) - 863 freq himsel' (1) - 4 freq hisself (1) - 3 freq hisel (2) - 18 freq hirsel (2) - 119 freq herself (2) - 41 freq themself (2) - 1 freq himsael (2) - 4 freq hissel (2) - 371 freq itself (2) - 23 freq hissell (2) - 55 freq imsel (2) - 29 freq ahimsel (2) - 1 freq hinsel (2) - 1 freq thimsels (2) - 2 freq humsel (2) - 3 freq hizsel (2) - 1 freq dimsels (2) - 1 freq hurself (2) - 1 freq hirselfe (2) - 1 freq hisel' (2) - 1 freq hirsell (2) - 13 freq |
himself (0) - 99 freq hisself (2) - 3 freq himsel (2) - 863 freq himsel' (2) - 4 freq himsell (2) - 14 freq hizself (2) - 1 freq hurself (3) - 1 freq ahimsel (3) - 1 freq himsael (3) - 4 freq hpself (3) - 1 freq herself (3) - 41 freq hirselfe (3) - 1 freq themself (3) - 1 freq humsel (3) - 3 freq hirsels (4) - 3 freq hirselt (4) - 1 freq hisell (4) - 2 freq meself (4) - 2 freq myself (4) - 47 freq maself (4) - 21 freq hirsell (4) - 13 freq hidsel (4) - 7 freq hitsel (4) - 13 freq yirself (4) - 5 freq himsel's (4) - 2 freq |
SoundEx code - H524 himself - 99 freq himsel - 863 freq hansel - 16 freq himsel' - 4 freq 'heinkels - 1 freq himsell - 14 freq han-clap - 1 freq himsael - 4 freq hanselt - 3 freq hameschooled - 3 freq hameschool - 1 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 - HMSLF himself - 99 freq |
HIMSELF him - 8459 freq im - 370 freq 'im - 5 freq himsel - 863 freq himself - 99 freq hïm - 575 freq |
| Time to execute Levenshtein function - 0.187912 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.351378 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.027431 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.038164 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.000964 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. |