Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
herer (0) - 1 freq here- (1) - 1 freq hearer (1) - 1 freq hermer (1) - 1 freq herber (1) - 5 freq hever (1) - 2 freq herr (1) - 9 freq hirer (1) - 2 freq here' (1) - 3 freq here (1) - 4209 freq hered (1) - 2 freq heres (1) - 8 freq heer (1) - 19 freq herder (1) - 3 freq derek (2) - 40 freq peer (2) - 200 freq werner (2) - 1 freq where- (2) - 2 freq terr (2) - 9 freq orrer (2) - 1 freq helen (2) - 58 freq herbert (2) - 1 freq sewer (2) - 4 freq hereby (2) - 3 freq hefner (2) - 1 freq |
herer (0) - 1 freq hirer (1) - 2 freq hearer (1) - 1 freq herr (1) - 9 freq heer (2) - 19 freq heres (2) - 8 freq harr (2) - 2 freq hurr (2) - 1 freq hered (2) - 2 freq herder (2) - 3 freq herry (2) - 2 freq here (2) - 4209 freq hermer (2) - 1 freq here- (2) - 1 freq herber (2) - 5 freq here' (2) - 3 freq hever (2) - 2 freq heered (3) - 2 freq heeter (3) - 9 freq paerer (3) - 1 freq hater (3) - 2 freq harra (3) - 2 freq herk (3) - 3 freq harem (3) - 1 freq hear (3) - 1400 freq |
SoundEx code - H660 horror - 50 freq herer - 1 freq horrer - 1 freq hirer - 2 freq hairier - 2 freq hearer - 1 freq harrier - 2 freq horrur - 2 freq |
MetaPhone code - HRR horror - 50 freq herer - 1 freq horrer - 1 freq hirer - 2 freq hairier - 2 freq hearer - 1 freq harrier - 2 freq horrur - 2 freq |
HERER |
Time to execute Levenshtein function - 0.319462 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.540175 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.064178 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.077513 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.001049 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. |