| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haycorns (0) - 13 freq haycorn (1) - 2 freq acorns (2) - 1 freq mascorns (2) - 1 freq paycocks (3) - 2 freq taylors (3) - 1 freq harns (3) - 52 freq harpoons (3) - 3 freq hadrons (3) - 1 freq acorn (3) - 2 freq unicorns (3) - 9 freq scorns (3) - 1 freq acorss (3) - 9 freq halfords (3) - 2 freq alcorn (3) - 7 freq hayr's (3) - 1 freq taywords (3) - 1 freq adorns (3) - 2 freq horns (3) - 42 freq damorns (3) - 1 freq hairns (3) - 8 freq racords (3) - 4 freq mascorn (3) - 5 freq corns (3) - 1 freq falcons (3) - 2 freq |
haycorns (0) - 13 freq haycorn (2) - 2 freq acorns (3) - 1 freq scorns (4) - 1 freq corns (4) - 1 freq hairns (4) - 8 freq hadrons (4) - 1 freq horns (4) - 42 freq unicorns (4) - 9 freq mascorns (4) - 1 freq harns (4) - 52 freq hornes (5) - 2 freq curns (5) - 127 freq hoarns (5) - 2 freq hornis (5) - 2 freq crayons (5) - 4 freq harrans (5) - 1 freq herons (5) - 3 freq cairns (5) - 13 freq scarns (5) - 1 freq cornis (5) - 1 freq haiverins (5) - 2 freq acorss (5) - 9 freq alcorn (5) - 7 freq acorn (5) - 2 freq |
SoundEx code - H265 huggerin - 1 freq huggery-muggery - 1 freq hezron - 7 freq haycorns - 13 freq haycorn - 2 freq hie-groond - 1 freq hugger-mugger - 1 freq houseroom - 1 freq hawickremember - 9 freq hcurmi - 1 freq hhkrymesap - 1 freq hoosiermama - 1 freq |
MetaPhone code - HKRNS haycorns - 13 freq |
HAYCORNS |
| Time to execute Levenshtein function - 0.187105 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.339069 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.027435 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.037260 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.000848 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. |