| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harmless (0) - 6 freq harnless (1) - 3 freq hermless (1) - 6 freq hairmless (1) - 12 freq haimless (1) - 1 freq harkness (2) - 2 freq formless (2) - 2 freq hameless (2) - 17 freq halpless (2) - 1 freq hardness (2) - 1 freq hairmles (2) - 1 freq hapless (2) - 11 freq heartless (2) - 6 freq marless (2) - 8 freq haveless (2) - 1 freq careless (2) - 10 freq haanless (2) - 1 freq hertless (2) - 11 freq aimless (2) - 1 freq arkless (2) - 1 freq han-less (2) - 1 freq handless (2) - 3 freq haunless (2) - 3 freq haagless (2) - 1 freq furmless (2) - 1 freq |
harmless (0) - 6 freq hairmless (1) - 12 freq hermless (1) - 6 freq harnless (2) - 3 freq haimless (2) - 1 freq furmless (3) - 1 freq hertless (3) - 11 freq hairless (3) - 2 freq heartless (3) - 6 freq bairmless (3) - 2 freq hairtless (3) - 2 freq gormless (3) - 9 freq hameless (3) - 17 freq formless (3) - 2 freq hairmles (3) - 1 freq halpless (4) - 1 freq brimless (4) - 1 freq harness (4) - 14 freq homeless (4) - 3 freq hamlets (4) - 1 freq hapless (4) - 11 freq hardness (4) - 1 freq harkness (4) - 2 freq hermaness (4) - 1 freq haanless (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 |
HARMLESS |
| Time to execute Levenshtein function - 0.188455 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.365077 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.027480 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.037406 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.000884 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. |