| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hermless (0) - 6 freq hertless (1) - 11 freq harmless (1) - 6 freq heatless (2) - 1 freq hermes (2) - 7 freq furmless (2) - 1 freq harnless (2) - 3 freq hermaness (2) - 1 freq gormless (2) - 9 freq headless (2) - 1 freq kerless (2) - 1 freq helpless (2) - 17 freq heartless (2) - 6 freq heedless (2) - 6 freq formless (2) - 2 freq hertiess (2) - 1 freq hairmless (2) - 12 freq haimless (2) - 1 freq heidless (2) - 12 freq seamless (2) - 5 freq haveless (3) - 1 freq fekless (3) - 1 freq hairless (3) - 2 freq heralds- (3) - 1 freq feckless (3) - 14 freq |
hermless (0) - 6 freq harmless (1) - 6 freq hairmless (2) - 12 freq hertless (2) - 11 freq formless (3) - 2 freq gormless (3) - 9 freq heartless (3) - 6 freq harnless (3) - 3 freq hermaness (3) - 1 freq haimless (3) - 1 freq furmless (3) - 1 freq hairless (4) - 2 freq hairtless (4) - 2 freq dreamless (4) - 1 freq bairmless (4) - 2 freq hairmles (4) - 1 freq seamless (4) - 5 freq hameless (4) - 17 freq homeless (4) - 3 freq brimless (4) - 1 freq headless (4) - 1 freq helpless (4) - 17 freq kerless (4) - 1 freq hermes (4) - 7 freq heatless (4) - 1 freq |
SoundEx code - H654 hairmless - 12 freq harmless - 6 freq harnless - 3 freq hermless - 6 freq hairmles - 1 freq |
MetaPhone code - HRMLS hairmless - 12 freq harmless - 6 freq hermless - 6 freq hairmles - 1 freq |
HERMLESS |
| Time to execute Levenshtein function - 0.207406 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.369664 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.026993 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.039895 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.000784 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. |