Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hinnermost (0) - 1 freq innermost (1) - 1 freq innermosst (2) - 1 freq hinnermaist (2) - 39 freq hindermaist (3) - 2 freq winnermint (3) - 1 freq hinnert (3) - 3 freq fingerpost (3) - 2 freq hinners (3) - 5 freq hinmost (3) - 1 freq hindmost (3) - 1 freq innermaist (3) - 5 freq shinners (4) - 4 freq hinneren (4) - 44 freq hinnersin (4) - 4 freq hinnymoon (4) - 1 freq winneret (4) - 1 freq hinner (4) - 46 freq hinneryen (4) - 1 freq winnersome (4) - 1 freq hinnereyn (4) - 8 freq hinney's (4) - 1 freq hinny-pot (4) - 1 freq thunnerbolt (4) - 2 freq hunners (4) - 211 freq |
hinnermost (0) - 1 freq hinnermaist (2) - 39 freq innermost (2) - 1 freq innermaist (4) - 5 freq hindermaist (4) - 2 freq innermosst (4) - 1 freq hindmost (5) - 1 freq hinnmaist (5) - 1 freq hinmost (5) - 1 freq winnermint (5) - 1 freq hinnert (5) - 3 freq hinners (5) - 5 freq hunnerts (6) - 1 freq hunner's (6) - 1 freq hunnert (6) - 14 freq henners (6) - 1 freq hinemaist (6) - 1 freq hunnerds (6) - 1 freq hunners (6) - 211 freq inner-maist (6) - 1 freq wunnerment (6) - 2 freq fingerpost (6) - 2 freq hinnersin (6) - 4 freq sincerest (7) - 1 freq hinner-ens (7) - 1 freq |
SoundEx code - H565 haimmerin - 6 freq hinner-en - 25 freq hammerin - 18 freq hinnerend - 28 freq hinnereyn - 8 freq hinnerin - 2 freq honourin - 2 freq hinner-ens - 1 freq hemmerin - 7 freq hinnie-wairm - 1 freq hinner-end - 3 freq hinnermaist - 39 freq humourin - 1 freq hinneren - 44 freq hinnerein - 6 freq hinnerein's - 1 freq hinnèr-en - 1 freq hinnèrin - 1 freq hammeran - 1 freq hammermuggley - 1 freq haun-wringin - 2 freq hinnermost - 1 freq hinnerenn - 1 freq hinner-eyn - 1 freq hinneryen - 1 freq hinnerance - 1 freq hunner-an-siventy-odd - 1 freq hennerin - 1 freq hinnereine - 1 freq hunner-an-fowr-an-thritie - 1 freq han-ower-han - 1 freq haimerin - 1 freq homerange - 1 freq |
MetaPhone code - HNRMST hinnermaist - 39 freq hinnermost - 1 freq |
HINNERMOST |
Time to execute Levenshtein function - 0.216149 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.386464 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.028450 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.038737 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.000946 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. |