| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| herbie (0) - 11 freq derbie (1) - 2 freq heebie (1) - 3 freq herbrie (1) - 6 freq hertie (1) - 11 freq herrie (1) - 2 freq harlie (2) - 6 freq herdin (2) - 15 freq herber (2) - 5 freq barbie (2) - 3 freq horsie (2) - 7 freq ferrie (2) - 7 freq harrie (2) - 2 freq heroin (2) - 5 freq heroine (2) - 6 freq kerrie (2) - 1 freq ermie (2) - 1 freq heroic (2) - 8 freq herkin (2) - 3 freq herbor (2) - 1 freq perrie (2) - 1 freq aerlie (2) - 10 freq versie (2) - 1 freq herrin (2) - 24 freq herrien (2) - 1 freq |
herbie (0) - 11 freq herb (2) - 2 freq hertie (2) - 11 freq herrie (2) - 2 freq herbrie (2) - 6 freq derbie (2) - 2 freq heebie (2) - 3 freq hubbie (3) - 1 freq harvie (3) - 3 freq herbs (3) - 14 freq serbia (3) - 4 freq habbie (3) - 9 freq heris (3) - 1 freq humbie (3) - 1 freq hardie (3) - 26 freq hurdie (3) - 4 freq herbal (3) - 5 freq herein (3) - 7 freq corbie (3) - 27 freq hibbie (3) - 2 freq hurrie (3) - 1 freq hobbie (3) - 1 freq herin (3) - 2 freq hornie (3) - 5 freq here (3) - 4207 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 |
HERBIE |
| Time to execute Levenshtein function - 0.353255 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.397749 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.032562 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.041788 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.000947 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. |