Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hairldy (0) - 1 freq haild (2) - 2 freq hairdo (2) - 3 freq nairly (2) - 1 freq airly (2) - 20 freq hair-dye (2) - 4 freq fairdy (2) - 1 freq haird (2) - 124 freq haurly (2) - 16 freq hair-do (2) - 2 freq harld (2) - 1 freq harly (2) - 13 freq hairdly (2) - 55 freq rairly (2) - 1 freq bairdy (2) - 2 freq hardy (2) - 24 freq hairry (2) - 1 freq fairly (2) - 235 freq harley (2) - 7 freq sairly (2) - 28 freq hairy (2) - 93 freq shairly (2) - 107 freq fairley (2) - 1 freq haired (2) - 7 freq hairty (2) - 3 freq |
hairldy (0) - 1 freq harld (2) - 1 freq harled (3) - 6 freq harly (3) - 13 freq harley (3) - 7 freq harald (3) - 17 freq harold (3) - 13 freq haired (3) - 7 freq haerald (3) - 1 freq hardy (3) - 24 freq hairdo (3) - 3 freq hair-do (3) - 2 freq hair-dye (3) - 4 freq haird (3) - 124 freq haild (3) - 2 freq haurly (3) - 16 freq hilda (4) - 23 freq heird (4) - 1 freq harlin (4) - 3 freq harlit (4) - 2 freq harlt (4) - 5 freq haurd (4) - 152 freq haard (4) - 17 freq wirld (4) - 73 freq heild (4) - 48 freq |
SoundEx code - H643 harled - 6 freq herald - 34 freq hurled - 21 freq hairldy - 1 freq harlot - 2 freq harlit - 2 freq heralded - 2 freq heraldin - 1 freq harald - 17 freq harald's - 2 freq heraldit - 1 freq hurlit - 1 freq harold - 13 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 - 34 freq hurled - 21 freq hairldy - 1 freq harlot - 2 freq harlit - 2 freq harald - 17 freq hurlit - 1 freq harold - 13 freq haerald - 1 freq hurlt - 3 freq harld - 1 freq harlt - 5 freq hurrelt - 1 freq hurl't - 1 freq |
HAIRLDY |
Time to execute Levenshtein function - 0.208537 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.397351 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.028892 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.042471 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.000893 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. |