| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hildebrand (0) - 6 freq hildebrand's (2) - 2 freq hinderend (3) - 1 freq hadubrand (3) - 4 freq dilderan (3) - 1 freq hinnerend (4) - 28 freq hieland (4) - 16 freq heribrand (4) - 1 freq goodbrand (4) - 1 freq rebrand (4) - 2 freq clarebrand (4) - 1 freq hinderance (4) - 1 freq aldeberan (4) - 1 freq heid-brandy (4) - 1 freq winderan (4) - 2 freq celebrant (4) - 30 freq mitterand (4) - 4 freq heidbrandy (4) - 1 freq hindered (4) - 3 freq sideboard (4) - 20 freq dillderan (4) - 1 freq winderin (5) - 17 freq pleisand (5) - 1 freq headboard (5) - 1 freq hidenin (5) - 1 freq |
hildebrand (0) - 6 freq hadubrand (4) - 4 freq hildebrand's (4) - 2 freq hinderend (5) - 1 freq heidbrandy (5) - 1 freq aldeberan (6) - 1 freq heid-brandy (6) - 1 freq clarebrand (6) - 1 freq heribrand (6) - 1 freq dilderan (6) - 1 freq goodbrand (6) - 1 freq sideboard (7) - 20 freq childbearin (7) - 4 freq heilbronn (7) - 3 freq heidboard (7) - 3 freq headboard (7) - 1 freq hindered (7) - 3 freq rebrand (7) - 2 freq hinderance (7) - 1 freq celebrant (7) - 30 freq hinnerend (7) - 28 freq hieland (7) - 16 freq buldered (8) - 1 freq guldering (8) - 2 freq hiberno (8) - 1 freq |
SoundEx code - H431 hilltaps - 1 freq hill-taps - 1 freq hill-tap - 2 freq held-up - 1 freq hilltop - 3 freq healthfu' - 1 freq hildebrand - 6 freq hildebrand's - 2 freq hilltap - 1 freq hulltap - 1 freq heldup - 1 freq holdup - 1 freq hooletfringe - 1 freq holdfast - 5 freq |
MetaPhone code - HLTBRNT hildebrand - 6 freq |
HILDEBRAND |
| Time to execute Levenshtein function - 0.199616 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.366649 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.034191 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.047070 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. |