| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| herm (0) - 49 freq helm (1) - 15 freq herd (1) - 157 freq hemm (1) - 12 freq hert (1) - 762 freq perm (1) - 3 freq her (1) - 14018 freq harm (1) - 21 freq heem (1) - 17 freq germ (1) - 3 freq hers (1) - 84 freq cherm (1) - 5 freq her- (1) - 1 freq herb (1) - 2 freq her' (1) - 2 freq herc (1) - 1 freq hero (1) - 81 freq here (1) - 4136 freq erm (1) - 66 freq herz (1) - 1 freq verm (1) - 1 freq ferm (1) - 340 freq heim (1) - 2 freq hera (1) - 12 freq herr (1) - 9 freq |
herm (0) - 49 freq harm (1) - 21 freq verm (2) - 1 freq ferm (2) - 340 freq herz (2) - 1 freq erm (2) - 66 freq here (2) - 4136 freq heim (2) - 2 freq hera (2) - 12 freq herk (2) - 3 freq harem (2) - 1 freq hem (2) - 27 freq herr (2) - 9 freq hero (2) - 81 freq hairm (2) - 63 freq term (2) - 98 freq perm (2) - 3 freq her (2) - 14018 freq hert (2) - 762 freq hemm (2) - 12 freq helm (2) - 15 freq herc (2) - 1 freq heem (2) - 17 freq herd (2) - 157 freq her' (2) - 2 freq |
SoundEx code - H650 heron - 13 freq hairm - 63 freq hearin - 174 freq hornie - 5 freq hurryin - 6 freq horn - 57 freq herrin - 23 freq haroan - 1 freq herm - 49 freq hureheon - 1 freq harm - 21 freq harn - 3 freq heerin - 3 freq horne - 2 freq herryin - 2 freq hearan - 14 freq heroin - 5 freq heeren - 2 freq herrin' - 5 freq hearin' - 1 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 - 49 freq harm - 21 freq harem - 1 freq |
HERM |
| Time to execute Levenshtein function - 0.372952 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.685765 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.084298 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.040017 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.000813 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. |