| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairless (0) - 2 freq hairmless (1) - 12 freq hairtless (1) - 2 freq lairless (1) - 1 freq haimless (1) - 1 freq airless (1) - 1 freq sairless (1) - 1 freq marless (2) - 8 freq haiveless (2) - 1 freq fairness (2) - 11 freq han-less (2) - 1 freq heidless (2) - 12 freq hailes (2) - 3 freq hairvest (2) - 19 freq sairness (2) - 8 freq saikless (2) - 7 freq haunless (2) - 3 freq harnless (2) - 3 freq hairdness (2) - 1 freq maikless (2) - 2 freq chairles (2) - 16 freq harmless (2) - 6 freq handless (2) - 3 freq hapless (2) - 11 freq aimless (2) - 1 freq |
hairless (0) - 2 freq sairless (2) - 1 freq haimless (2) - 1 freq airless (2) - 1 freq lairless (2) - 1 freq hairtless (2) - 2 freq hairmless (2) - 12 freq haveless (3) - 1 freq harnless (3) - 3 freq harmless (3) - 6 freq haanless (3) - 1 freq hameless (3) - 17 freq haunless (3) - 3 freq hapless (3) - 11 freq haagless (3) - 1 freq harness (3) - 14 freq haiveless (3) - 1 freq heidless (3) - 12 freq marless (3) - 8 freq yearless (4) - 1 freq tireless (4) - 1 freq heatless (4) - 1 freq peerless (4) - 1 freq weerless (4) - 2 freq wireless (4) - 55 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.208940 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.356275 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.027758 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.036909 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.000827 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. |