| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gerald (0) - 26 freq herald (1) - 34 freq gerard (1) - 2 freq haerald (2) - 1 freq grals (2) - 1 freq gead (2) - 2 freq feral (2) - 6 freq gealt (2) - 3 freq geraff (2) - 1 freq genral (2) - 4 freq eraly (2) - 1 freq gerrard (2) - 1 freq grand (2) - 363 freq emerald (2) - 17 freq harald (2) - 17 freq gerald's (2) - 2 freq geraldine (3) - 1 freq glaid (3) - 26 freq gorged (3) - 2 freq bewalt (3) - 1 freq verbals (3) - 1 freq eerant (3) - 2 freq heraldin (3) - 1 freq gerse (3) - 2 freq werain (3) - 1 freq |
gerald (0) - 26 freq gerard (2) - 2 freq herald (2) - 34 freq emerald (3) - 17 freq grand (3) - 363 freq gurled (3) - 10 freq grals (3) - 1 freq harald (3) - 17 freq haerald (3) - 1 freq graand (4) - 4 freq grande (4) - 1 freq gard (4) - 4 freq ruld (4) - 1 freq garland (4) - 5 freq gord (4) - 1 freq grill (4) - 5 freq glad (4) - 105 freq girl' (4) - 1 freq graned (4) - 2 freq geared (4) - 2 freq gurgled (4) - 3 freq grind (4) - 26 freq guild (4) - 11 freq graved (4) - 1 freq graded (4) - 3 freq |
SoundEx code - G643 growled - 14 freq growlt - 4 freq gurled - 10 freq growlit - 2 freq gerald - 26 freq gerald'li - 1 freq gerald's - 2 freq gurl't - 2 freq grilled - 2 freq geraldine - 1 freq geraldinekell - 1 freq |
MetaPhone code - JRLT gerald - 26 freq jorrylad - 1 freq |
GERALD |
| Time to execute Levenshtein function - 0.194212 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.362817 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.028795 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.039501 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.000952 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. |