| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hermer (0) - 1 freq fermer (1) - 194 freq herder (1) - 3 freq hermed (1) - 2 freq hermes (1) - 7 freq herber (1) - 5 freq hemmer (1) - 21 freq herer (1) - 1 freq warmer (2) - 25 freq heroes (2) - 39 freq fermed (2) - 10 freq hersef (2) - 1 freq nerrer (2) - 2 freq herman (2) - 1 freq herm's (2) - 3 freq heeter (2) - 9 freq heifer (2) - 5 freq beamer (2) - 12 freq server (2) - 2 freq here' (2) - 3 freq helter (2) - 3 freq beemer (2) - 2 freq firmer (2) - 4 freq herted (2) - 6 freq hemmed (2) - 3 freq |
hermer (0) - 1 freq herber (2) - 5 freq herer (2) - 1 freq hermes (2) - 7 freq hemmer (2) - 21 freq fermer (2) - 194 freq hermed (2) - 2 freq herder (2) - 3 freq hummer (3) - 2 freq hammer (3) - 44 freq former (3) - 40 freq heirder (3) - 1 freq dormer (3) - 2 freq homer (3) - 1 freq hermin (3) - 2 freq hirer (3) - 2 freq murmer (3) - 2 freq charmer (3) - 3 freq herm (3) - 51 freq herbor (3) - 1 freq hermfu (3) - 3 freq herbeur (3) - 1 freq harper (3) - 3 freq horner (3) - 2 freq hermon (3) - 1 freq |
SoundEx code - H656 hermer - 1 freq horner - 2 freq horn-rimmed - 1 freq hornier - 1 freq harnwirkers - 1 freq |
MetaPhone code - HRMR hermer - 1 freq |
HERMER |
| Time to execute Levenshtein function - 0.238262 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.366323 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.028056 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.037736 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.000991 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. |