| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairm (0) - 63 freq chairm (1) - 11 freq hairs (1) - 38 freq haird (1) - 124 freq wairm (1) - 46 freq airm (1) - 358 freq thairm (1) - 3 freq gairm (1) - 4 freq hairb (1) - 1 freq hairms (1) - 2 freq harm (1) - 22 freq tairm (1) - 13 freq hair' (1) - 2 freq hairy (1) - 93 freq haim (1) - 39 freq hairp (1) - 5 freq fairm (1) - 126 freq haimm (1) - 1 freq hairt (1) - 341 freq hair (1) - 902 freq garm (2) - 1 freq heirs (2) - 8 freq dairt (2) - 6 freq heirt (2) - 4 freq laird (2) - 173 freq |
hairm (0) - 63 freq harm (1) - 22 freq fairm (2) - 126 freq haim (2) - 39 freq hairy (2) - 93 freq haimm (2) - 1 freq hairt (2) - 341 freq herm (2) - 51 freq harem (2) - 1 freq hair (2) - 902 freq hair' (2) - 2 freq hairp (2) - 5 freq chairm (2) - 11 freq tairm (2) - 13 freq haird (2) - 124 freq hairs (2) - 38 freq wairm (2) - 46 freq airm (2) - 358 freq hairms (2) - 2 freq hairb (2) - 1 freq gairm (2) - 4 freq thairm (2) - 3 freq chirm (3) - 1 freq harn (3) - 5 freq hamm (3) - 1 freq |
SoundEx code - H650 heron - 13 freq hairm - 63 freq hearin - 174 freq hornie - 5 freq hurryin - 6 freq horn - 59 freq herrin - 24 freq haroan - 1 freq herm - 51 freq hureheon - 1 freq harm - 22 freq harn - 5 freq heerin - 3 freq horne - 2 freq herryin - 2 freq hearan - 14 freq heroin - 5 freq heeren - 2 freq herrin' - 5 freq hearin' - 2 freq heroine - 6 freq herein - 7 freq hirin - 3 freq hirin' - 1 freq hairin - 3 freq hoorin - 3 freq harin - 2 freq h'r'm - 1 freq herin - 2 freq hurrin - 1 freq hoarn - 1 freq hraun - 1 freq 'hearan' - 1 freq hurryan - 1 freq hearna - 1 freq harrowin - 2 freq heirin - 2 freq hurin - 1 freq herriein - 1 freq hooerin - 1 freq herrien - 1 freq harne - 2 freq hoorin' - 3 freq harem - 1 freq horny - 1 freq hernia - 1 freq |
MetaPhone code - HRM hairm - 63 freq herm - 51 freq harm - 22 freq harem - 1 freq |
HAIRM |
| Time to execute Levenshtein function - 0.587169 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.228456 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.090387 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.097469 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.001040 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. |