| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairmles (0) - 1 freq hairmless (1) - 12 freq hairies (2) - 4 freq hairless (2) - 2 freq hairdnes (2) - 1 freq harmless (2) - 6 freq bairmless (2) - 2 freq haimes (2) - 3 freq hairm's (2) - 3 freq airmies (2) - 16 freq hairms (2) - 2 freq chairles (2) - 16 freq hairmed (2) - 4 freq hailes (2) - 3 freq hirples (2) - 7 freq hairtless (2) - 2 freq haimless (2) - 1 freq harled (3) - 6 freq aires (3) - 1 freq charles (3) - 51 freq lairdies (3) - 16 freq firmlee (3) - 1 freq hackles (3) - 3 freq armies (3) - 4 freq paiddles (3) - 2 freq |
hairmles (0) - 1 freq hairmless (2) - 12 freq hairms (3) - 2 freq hairm's (3) - 3 freq hirples (3) - 7 freq harmless (3) - 6 freq hairtless (4) - 2 freq haimless (4) - 1 freq haurdlies (4) - 1 freq hermless (4) - 6 freq hummles (4) - 1 freq harm's (4) - 1 freq hurdles (4) - 1 freq hermes (4) - 7 freq haimes (4) - 3 freq hailes (4) - 3 freq bairmless (4) - 2 freq hairdnes (4) - 1 freq hairless (4) - 2 freq airmies (4) - 16 freq chairles (4) - 16 freq hairmed (4) - 4 freq hairies (4) - 4 freq warbles (5) - 3 freq haundles (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 |
HAIRMLES |
| Time to execute Levenshtein function - 0.834997 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.157008 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.028078 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.100902 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.000934 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. |