Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hanlon (0) - 2 freq hallon (1) - 1 freq hanson (1) - 1 freq hanlo (1) - 1 freq salon (2) - 10 freq hannlin (2) - 26 freq hallan (2) - 1 freq landon (2) - 2 freq lanyon (2) - 1 freq haldon (2) - 1 freq handlin (2) - 1 freq fanton (2) - 3 freq halin (2) - 1 freq canton (2) - 2 freq marlon (2) - 1 freq chanson (2) - 1 freq hannin (2) - 3 freq sanson (2) - 1 freq hailin (2) - 7 freq hanles (2) - 1 freq handin (2) - 15 freq anon (2) - 6 freq haulin (2) - 19 freq alon (2) - 2 freq haunlin (2) - 5 freq |
hanlon (0) - 2 freq haunlin (2) - 5 freq hanlo (2) - 1 freq hanson (2) - 1 freq hallon (2) - 1 freq hann (3) - 23 freq hanlins (3) - 1 freq hanles (3) - 1 freq conlon (3) - 1 freq hanle (3) - 4 freq haulin (3) - 19 freq harlin (3) - 3 freq hallion (3) - 16 freq haalin (3) - 9 freq haalan (3) - 2 freq hailin (3) - 7 freq haulen (3) - 10 freq hantin (3) - 6 freq handin (3) - 15 freq halin (3) - 1 freq handlin (3) - 1 freq hallan (3) - 1 freq handen (3) - 1 freq hannin (3) - 3 freq hannlin (3) - 26 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 |
HANLON |
Time to execute Levenshtein function - 0.205989 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.364251 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.030408 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.039269 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.000961 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. |