| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hannlin (0) - 26 freq hannlins (1) - 39 freq handlin (1) - 1 freq hannin (1) - 3 freq haunnlin (1) - 1 freq haunlin (1) - 5 freq haiglin (2) - 3 freq huntlin (2) - 2 freq cantlin (2) - 1 freq hauntin (2) - 4 freq handling (2) - 1 freq fanklin (2) - 5 freq sannyin (2) - 1 freq hainin (2) - 20 freq dinnlin (2) - 2 freq haunnin (2) - 1 freq haundlin (2) - 10 freq channelin (2) - 1 freq haunling (2) - 6 freq pannelin (2) - 1 freq haundin (2) - 18 freq handin (2) - 15 freq runnlin (2) - 1 freq haunlit (2) - 1 freq handelin (2) - 1 freq |
hannlin (0) - 26 freq haunnlin (1) - 1 freq haunlin (2) - 5 freq handlin (2) - 1 freq hannlins (2) - 39 freq hannin (2) - 3 freq hanselin (3) - 1 freq gainnlin (3) - 1 freq runnlin (3) - 1 freq kinnlin (3) - 10 freq handelin (3) - 1 freq hannles (3) - 5 freq hannle (3) - 5 freq hannled (3) - 2 freq hnnin (3) - 1 freq pannelin (3) - 1 freq kennlin (3) - 5 freq hanlon (3) - 2 freq hinnyin (3) - 1 freq haunnin (3) - 1 freq dinnlin (3) - 2 freq haundlin (3) - 10 freq huntlin (3) - 2 freq channelin (3) - 1 freq hailin (4) - 7 freq |
SoundEx code - H545 hamelaund - 1 freq hyne-launds - 1 freq hameland - 7 freq haunlin - 5 freq hanlins - 1 freq hummelness - 1 freq hamelan' - 1 freq haunling - 6 freq han-looms - 1 freq hannlin - 26 freq hannlins - 39 freq hamelins - 1 freq hamelan - 1 freq himalayan - 1 freq haunnlin - 1 freq homeland - 1 freq himlane - 1 freq hameliness - 1 freq hamelaun - 1 freq hanlon - 2 freq |
MetaPhone code - HNLN haunlin - 5 freq hannlin - 26 freq haunnlin - 1 freq hanlon - 2 freq |
HANNLIN |
| Time to execute Levenshtein function - 0.356968 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.531682 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.077448 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.037147 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.000873 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. |