| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hinnerlie (0) - 10 freq innerlie (1) - 7 freq ainerlie (2) - 2 freq hinnersin (2) - 4 freq hinnerly (2) - 1 freq hinnerin (2) - 2 freq sinnerie (2) - 1 freq unnerlie (2) - 1 freq hinnereine (2) - 1 freq hinnerein (2) - 6 freq finerie (3) - 2 freq unnerline (3) - 2 freq sickerlie (3) - 1 freq dinnertime (3) - 3 freq finngerie (3) - 1 freq binnerin (3) - 1 freq hinnerenn (3) - 1 freq hinnereyn (3) - 8 freq tenderlie (3) - 1 freq hinderly (3) - 1 freq hinner-en (3) - 25 freq litherlie (3) - 1 freq €™anerlie (3) - 1 freq hinner (3) - 46 freq hinneren (3) - 44 freq |
hinnerlie (0) - 10 freq innerlie (2) - 7 freq hinnerly (2) - 1 freq hinnereine (3) - 1 freq hinnerein (3) - 6 freq unnerlie (3) - 1 freq hinnerin (3) - 2 freq hinneren (4) - 44 freq hinner (4) - 46 freq hinneryen (4) - 1 freq hennerin (4) - 1 freq hinners (4) - 5 freq hinderly (4) - 1 freq hinnert (4) - 3 freq innerly (4) - 2 freq hinnered (4) - 1 freq hinnereyn (4) - 8 freq hinnersin (4) - 4 freq sinnerie (4) - 1 freq ainerlie (4) - 2 freq hunnel (5) - 4 freq hunnert (5) - 14 freq henner (5) - 3 freq hunnle (5) - 2 freq mannerly (5) - 1 freq |
SoundEx code - H564 hinnerlie - 10 freq hinnerly - 1 freq hame-rule - 8 freq |
MetaPhone code - HNRL hinnerlie - 10 freq hinnerly - 1 freq |
HINNERLIE |
| Time to execute Levenshtein function - 0.236930 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.368604 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.027417 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.037107 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.000886 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. |