| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| herald (0) - 33 freq harald (1) - 17 freq haerald (1) - 1 freq gerald (1) - 26 freq hera's (2) - 1 freq heeld (2) - 2 freq hera (2) - 12 freq harold (2) - 8 freq feral (2) - 5 freq heild (2) - 48 freq herted (2) - 6 freq hered (2) - 2 freq harld (2) - 1 freq held (2) - 505 freq emerald (2) - 17 freq her'd (2) - 1 freq healt (2) - 11 freq herald's (2) - 2 freq he'ard (2) - 1 freq heraldit (2) - 1 freq healed (2) - 10 freq head (2) - 247 freq heuld (2) - 1 freq herned (2) - 1 freq herawa (2) - 1 freq |
herald (0) - 33 freq harald (1) - 17 freq haerald (1) - 1 freq harld (2) - 1 freq gerald (2) - 26 freq harold (2) - 8 freq herod (3) - 49 freq heralded (3) - 2 freq heard (3) - 1263 freq herned (3) - 1 freq heuld (3) - 1 freq hermed (3) - 2 freq harled (3) - 6 freq heryd (3) - 1 freq herded (3) - 1 freq hurled (3) - 20 freq herd (3) - 157 freq healed (3) - 10 freq heraldin (3) - 1 freq heraldry (3) - 1 freq heraldic (3) - 2 freq hered (3) - 2 freq herted (3) - 6 freq heild (3) - 48 freq heeld (3) - 2 freq |
SoundEx code - H643 harled - 6 freq herald - 33 freq hurled - 20 freq hairldy - 1 freq harlot - 2 freq harlit - 1 freq heralded - 2 freq heraldin - 1 freq harald - 17 freq harald's - 2 freq heraldit - 1 freq hurlit - 1 freq harold - 8 freq haerald - 1 freq hurlt - 3 freq heraldic - 2 freq herraldit - 1 freq haroldsgarth - 1 freq harld - 1 freq harlt - 5 freq hurrelt - 1 freq hurl't - 1 freq heraldry - 1 freq herald's - 2 freq heraldscotland - 12 freq harlowtownfc - 1 freq heralds- - 1 freq |
MetaPhone code - HRLT harled - 6 freq herald - 33 freq hurled - 20 freq hairldy - 1 freq harlot - 2 freq harlit - 1 freq harald - 17 freq hurlit - 1 freq harold - 8 freq haerald - 1 freq hurlt - 3 freq harld - 1 freq harlt - 5 freq hurrelt - 1 freq hurl't - 1 freq |
HERALD |
| Time to execute Levenshtein function - 0.308920 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.577063 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.028309 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.086465 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.000809 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. |