Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
herm (0) - 51 freq herz (1) - 1 freq here (1) - 4207 freq hemm (1) - 12 freq hem (1) - 27 freq cherm (1) - 5 freq perm (1) - 3 freq germ (1) - 3 freq her (1) - 14060 freq helm (1) - 15 freq hera (1) - 12 freq term (1) - 99 freq harm (1) - 22 freq ferm (1) - 340 freq verm (1) - 1 freq herb (1) - 2 freq herd (1) - 158 freq herc (1) - 1 freq her' (1) - 2 freq herr (1) - 9 freq hero (1) - 83 freq hers (1) - 85 freq herk (1) - 3 freq her- (1) - 1 freq heim (1) - 2 freq |
herm (0) - 51 freq harm (1) - 22 freq hero (2) - 83 freq hers (2) - 85 freq herr (2) - 9 freq herc (2) - 1 freq herk (2) - 3 freq her' (2) - 2 freq her- (2) - 1 freq harem (2) - 1 freq hairm (2) - 63 freq hert (2) - 770 freq erm (2) - 70 freq heim (2) - 2 freq herd (2) - 158 freq heem (2) - 17 freq cherm (2) - 5 freq perm (2) - 3 freq hem (2) - 27 freq here (2) - 4207 freq herz (2) - 1 freq herb (2) - 2 freq germ (2) - 3 freq hemm (2) - 12 freq her (2) - 14060 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 |
HERM |
Time to execute Levenshtein function - 0.175103 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.329009 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.027414 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.037182 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.001175 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. |