| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairmless (0) - 12 freq harmless (1) - 6 freq bairmless (1) - 2 freq haimless (1) - 1 freq hairmles (1) - 1 freq hairtless (1) - 2 freq hairless (1) - 2 freq bairnless (2) - 3 freq sairless (2) - 1 freq aimless (2) - 1 freq airless (2) - 1 freq hairdness (2) - 1 freq hermless (2) - 6 freq hairstless (2) - 1 freq haiveless (2) - 1 freq lairless (2) - 1 freq harnless (2) - 3 freq halpless (3) - 1 freq hamlets (3) - 1 freq saimness (3) - 1 freq wireless (3) - 55 freq hairies (3) - 4 freq haagless (3) - 1 freq han-less (3) - 1 freq hairm's (3) - 3 freq |
hairmless (0) - 12 freq harmless (1) - 6 freq hairless (2) - 2 freq hermless (2) - 6 freq hairtless (2) - 2 freq hairmles (2) - 1 freq haimless (2) - 1 freq bairmless (2) - 2 freq harnless (3) - 3 freq hertless (4) - 11 freq brimless (4) - 1 freq furmless (4) - 1 freq heartless (4) - 6 freq gormless (4) - 9 freq hameless (4) - 17 freq formless (4) - 2 freq lairless (4) - 1 freq airless (4) - 1 freq aimless (4) - 1 freq sairless (4) - 1 freq bairnless (4) - 3 freq hairstless (4) - 1 freq hairdness (4) - 1 freq haiveless (4) - 1 freq hairms (5) - 2 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 |
HAIRMLESS |
| Time to execute Levenshtein function - 1.003158 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 - 1.508984 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.176381 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.102782 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.000773 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. |