Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hinnerly (0) - 1 freq hinderly (1) - 1 freq innerly (1) - 2 freq ainerly (2) - 2 freq gingerly (2) - 2 freq hinners (2) - 5 freq mennerly (2) - 2 freq hinnert (2) - 3 freq hinnered (2) - 1 freq chinnery (2) - 1 freq hinnerin (2) - 2 freq hinney (2) - 6 freq mannerly (2) - 1 freq hinner (2) - 46 freq hinnereyn (2) - 8 freq hinneren (2) - 44 freq hinnerlie (2) - 10 freq hinders (3) - 2 freq bitterly (3) - 9 freq jinery (3) - 1 freq donnelly (3) - 1 freq unnerlay (3) - 1 freq dinners (3) - 14 freq whinner (3) - 1 freq henery (3) - 1 freq |
hinnerly (0) - 1 freq innerly (2) - 2 freq hinnerlie (2) - 10 freq hinderly (2) - 1 freq mannerly (3) - 1 freq hinner (3) - 46 freq hinneren (3) - 44 freq hinnerin (3) - 2 freq hinnereyn (3) - 8 freq hinnered (3) - 1 freq hinners (3) - 5 freq mennerly (3) - 2 freq hinnert (3) - 3 freq henner (4) - 3 freq hannel (4) - 1 freq hennerin (4) - 1 freq hunners (4) - 211 freq hinnerein (4) - 6 freq hunnerd (4) - 2 freq innerlie (4) - 7 freq hunnert (4) - 14 freq hinneryen (4) - 1 freq henners (4) - 1 freq hunnel (4) - 4 freq hunner (4) - 442 freq |
SoundEx code - H564 hinnerlie - 10 freq hinnerly - 1 freq hame-rule - 8 freq |
MetaPhone code - HNRL hinnerlie - 10 freq hinnerly - 1 freq |
HINNERLY |
Time to execute Levenshtein function - 0.282254 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.642232 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.061196 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.104073 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.001220 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. |