| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harold (0) - 8 freq harld (1) - 1 freq harald (1) - 17 freq herald (2) - 33 freq herod (2) - 49 freq haild (2) - 2 freq carolm (2) - 2 freq hardly (2) - 209 freq harled (2) - 6 freq carols (2) - 3 freq hared (2) - 1 freq haroan (2) - 1 freq warld (2) - 820 freq haerald (2) - 1 freq barolo (2) - 1 freq harlt (2) - 5 freq carole (2) - 3 freq hard (2) - 782 freq harmed (2) - 1 freq harl (2) - 5 freq paroled (2) - 1 freq hauld (2) - 11 freq harly (2) - 13 freq harned (2) - 3 freq hafolk (2) - 1 freq |
harold (0) - 8 freq harld (1) - 1 freq harald (1) - 17 freq haerald (2) - 1 freq harled (2) - 6 freq herald (2) - 33 freq harl (3) - 5 freq paroled (3) - 1 freq harmed (3) - 1 freq harly (3) - 13 freq hairldy (3) - 1 freq hold (3) - 65 freq harned (3) - 3 freq harlt (3) - 5 freq hauld (3) - 11 freq hard (3) - 782 freq hared (3) - 1 freq hurled (3) - 20 freq warld (3) - 820 freq haild (3) - 2 freq herod (3) - 49 freq wirld (4) - 73 freq hurlt (4) - 3 freq harlaw (4) - 4 freq hird (4) - 27 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 |
HAROLD |
| Time to execute Levenshtein function - 0.190568 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.343983 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.032064 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.038749 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.000852 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. |