| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairless (0) - 2 freq hairmless (1) - 12 freq hairtless (1) - 2 freq lairless (1) - 1 freq airless (1) - 1 freq haimless (1) - 1 freq sairless (1) - 1 freq han-less (2) - 1 freq bairnless (2) - 3 freq haagless (2) - 1 freq harmless (2) - 6 freq haunless (2) - 3 freq hapless (2) - 11 freq handless (2) - 3 freq harness (2) - 14 freq sairness (2) - 8 freq haiveless (2) - 1 freq saikless (2) - 8 freq fairness (2) - 11 freq harnless (2) - 3 freq marless (2) - 8 freq chairles (2) - 16 freq hairmles (2) - 1 freq hairdness (2) - 1 freq haveless (2) - 1 freq |
hairless (0) - 2 freq haimless (2) - 1 freq airless (2) - 1 freq sairless (2) - 1 freq hairmless (2) - 12 freq hairtless (2) - 2 freq lairless (2) - 1 freq marless (3) - 8 freq haiveless (3) - 1 freq haveless (3) - 1 freq haanless (3) - 1 freq harness (3) - 14 freq heidless (3) - 12 freq hameless (3) - 17 freq harnless (3) - 3 freq haunless (3) - 3 freq haagless (3) - 1 freq harmless (3) - 6 freq hapless (3) - 11 freq heedless (4) - 6 freq hopeless (4) - 12 freq fearless (4) - 10 freq harass (4) - 2 freq hertless (4) - 11 freq weerless (4) - 2 freq |
SoundEx code - H642 hurls - 4 freq hirlsel - 1 freq horrals - 1 freq hurlies - 1 freq harlequin - 3 freq hurlygush - 1 freq hairless - 2 freq hairyollies - 2 freq |
MetaPhone code - HRLS hurls - 4 freq horrals - 1 freq hurlies - 1 freq hairless - 2 freq |
HAIRLESS |
| Time to execute Levenshtein function - 0.205949 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.456149 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.030012 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.039242 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.001121 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. |