| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| herb (0) - 2 freq hert (1) - 770 freq here (1) - 4207 freq herz (1) - 1 freq her' (1) - 2 freq kerb (1) - 6 freq herc (1) - 1 freq hers (1) - 85 freq her (1) - 14060 freq herm (1) - 51 freq herr (1) - 9 freq her- (1) - 1 freq herbs (1) - 14 freq hera (1) - 12 freq heb (1) - 1 freq yerb (1) - 1 freq herd (1) - 158 freq hero (1) - 83 freq herk (1) - 3 freq verb (1) - 129 freq where (2) - 739 freq mer (2) - 7 freq held (2) - 509 freq heng (2) - 4 freq ferm (2) - 340 freq |
herb (0) - 2 freq herd (2) - 158 freq yerb (2) - 1 freq hera (2) - 12 freq hero (2) - 83 freq heb (2) - 1 freq verb (2) - 129 freq hereby (2) - 3 freq ahrb (2) - 1 freq herbie (2) - 11 freq herbs (2) - 14 freq herk (2) - 3 freq hairb (2) - 1 freq hert (2) - 770 freq her' (2) - 2 freq herz (2) - 1 freq her- (2) - 1 freq here (2) - 4207 freq kerb (2) - 6 freq herm (2) - 51 freq herr (2) - 9 freq her (2) - 14060 freq hers (2) - 85 freq herc (2) - 1 freq heryd (3) - 1 freq |
SoundEx code - H610 harp - 9 freq hairp - 5 freq hereby - 3 freq herb - 2 freq hairb - 1 freq harvey - 5 freq hrv - 1 freq her've - 1 freq harpa - 4 freq hairfaa - 1 freq hairpy - 1 freq herbie - 11 freq harvie - 3 freq hrf - 1 freq hraip - 1 freq hrp - 1 freq |
MetaPhone code - HRB hereby - 3 freq herb - 2 freq hairb - 1 freq herbie - 11 freq |
HERB |
| Time to execute Levenshtein function - 0.374419 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.623261 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.065496 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.058519 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.023254 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. |