| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haycorn (0) - 2 freq haycorns (1) - 13 freq alcorn (2) - 7 freq acorn (2) - 2 freq mascorn (2) - 5 freq hallon (3) - 1 freq falcon (3) - 4 freq raicord (3) - 1 freq hdycn (3) - 1 freq corn (3) - 104 freq adorn (3) - 6 freq scorn (3) - 18 freq racord (3) - 2 freq haroan (3) - 1 freq mayor (3) - 3 freq ayrn (3) - 1 freq hoyon (3) - 1 freq hanlon (3) - 2 freq hayen (3) - 13 freq raynor (3) - 1 freq hatchin (3) - 5 freq paycock (3) - 5 freq bayern (3) - 9 freq haldon (3) - 1 freq hacin (3) - 2 freq |
haycorn (0) - 2 freq haycorns (2) - 13 freq acorn (3) - 2 freq alcorn (3) - 7 freq hacin (4) - 2 freq haroan (4) - 1 freq horn (4) - 59 freq hackin (4) - 7 freq scorn (4) - 18 freq harn (4) - 5 freq 'corn (4) - 1 freq unicorn (4) - 61 freq mascorn (4) - 5 freq corn (4) - 104 freq crayon (5) - 2 freq haiverin (5) - 18 freq haafcroon (5) - 2 freq decern (5) - 2 freq haverin (5) - 25 freq heron (5) - 13 freq scarn (5) - 2 freq hoochin (5) - 2 freq hallon (5) - 1 freq rayburn (5) - 1 freq bacon (5) - 61 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 - HKRN huggerin - 1 freq haycorn - 2 freq |
HAYCORN |
| Time to execute Levenshtein function - 0.234228 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.355184 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.027891 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.038373 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.001004 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. |