| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| naehamecomforts (0) - 1 freq comforts (7) - 3 freq naeraboots (7) - 1 freq thamesmooth (8) - 1 freq comfort's (8) - 1 freq comfort (8) - 100 freq 'hamecomin' (8) - 1 freq hamecookin (8) - 1 freq hamecomin' (8) - 1 freq comfirts (8) - 1 freq newcomers (8) - 6 freq discomfort (8) - 10 freq hamecomin (8) - 11 freq nearaboots (8) - 1 freq agamemnon's (8) - 2 freq aeroports (8) - 1 freq naeraboot (8) - 4 freq debasements (9) - 1 freq saltirecomics (9) - 1 freq hame-awners (9) - 1 freq bachelor's (9) - 1 freq checkoots (9) - 1 freq haycorns (9) - 13 freq hame-comin (9) - 4 freq comfortab (9) - 1 freq |
naehamecomforts (0) - 1 freq comforts (10) - 3 freq comfirts (11) - 1 freq newcomers (12) - 6 freq discomfort (12) - 10 freq comfort (12) - 100 freq comfort's (12) - 1 freq thejamtarts (13) - 1 freq comfortin (13) - 14 freq comfortab (13) - 1 freq hammers (13) - 6 freq comfurt (13) - 1 freq comforter (13) - 2 freq comforted (13) - 3 freq comfirt (13) - 2 freq henceforth (13) - 2 freq hauncairts (13) - 1 freq hancairts (13) - 1 freq chamchars (13) - 1 freq hill-forts (13) - 1 freq 'hamecomin' (13) - 1 freq thamesmooth (13) - 1 freq naeraboots (13) - 1 freq hamecomin (13) - 11 freq hamecomin' (13) - 1 freq |
SoundEx code - N525 nonsense - 77 freq nonsense' - 1 freq non-accent - 1 freq nonagenarian - 1 freq non-committal - 1 freq non-commonity - 1 freq nansense - 1 freq name-caain - 1 freq nine-coonty - 1 freq noncommittal - 1 freq non-smoker - 1 freq noncombatant - 1 freq €œnonsense - 1 freq nonsensicaledonian - 1 freq naehamecomforts - 1 freq nonsinse - 1 freq nonsense- - 2 freq nonsence - 1 freq nonsensical - 1 freq nonacjiims - 1 freq |
MetaPhone code - NHMKMFRT |
NAEHAMECOMFORTS |
| Time to execute Levenshtein function - 0.237375 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.430754 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.027725 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.036809 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.000843 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. |