| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hawthorn (0) - 3 freq haltoun (3) - 1 freq awthein (3) - 9 freq whithorn (3) - 2 freq hawtin (3) - 1 freq hatton (3) - 1 freq hamelorn (3) - 2 freq awthou (3) - 1 freq 'authors (3) - 2 freq authors (3) - 16 freq author (3) - 37 freq cawther (3) - 1 freq awtroon (3) - 26 freq benthorn (3) - 1 freq haycorn (3) - 2 freq awthin (3) - 133 freq thorn (3) - 9 freq laithern (3) - 1 freq awtho (3) - 5 freq athort (3) - 122 freq authort (3) - 2 freq 'awthin (3) - 4 freq haithen (3) - 5 freq owthors (3) - 15 freq gathern (3) - 1 freq |
hawthorn (0) - 3 freq laithern (5) - 1 freq thorn (5) - 9 freq awthin (5) - 133 freq 'awthin (5) - 4 freq benthorn (5) - 1 freq haithen (5) - 5 freq watherin (5) - 1 freq owthor (5) - 11 freq gathern (5) - 1 freq owthors (5) - 15 freq awtroon (5) - 26 freq sowtherin (5) - 2 freq whithorn (5) - 2 freq cawther (5) - 1 freq hawtin (5) - 1 freq awthein (5) - 9 freq bothern (6) - 4 freq gethern (6) - 1 freq thern (6) - 1 freq gaitheran (6) - 2 freq heather (6) - 106 freq wathery (6) - 1 freq owthars (6) - 2 freq healthers (6) - 1 freq |
SoundEx code - H365 howderin - 3 freq hawthorn - 3 freq hotterin - 15 freq hadrons - 1 freq hotteran - 1 freq hadrian's - 4 freq heedrum-hodrums - 28 freq 'heedrum-hodrums - 2 freq 'heedrum - 1 freq hodrums - 1 freq heedrum-hodrumland - 1 freq heedrum-hodrumss - 2 freq heedrum-hodrum - 18 freq heedrumhodrum - 3 freq heedrum-hodrumish - 1 freq heedrumhodrums - 6 freq 'heedrum-hodrum - 4 freq heedrum-hodrum's - 1 freq hither-an-yon - 2 freq hadrian - 6 freq hodrum - 1 freq hyterin - 3 freq haterent - 1 freq heteronormative - 2 freq headroom - 1 freq heathermc - 8 freq heathermorven - 1 freq |
MetaPhone code - H0RN hawthorn - 3 freq |
HAWTHORN |
| Time to execute Levenshtein function - 0.225084 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.397430 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.028627 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.037270 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.000869 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. |