| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hopefully (0) - 60 freq hatefully (2) - 1 freq woefully (2) - 2 freq hoopfully (2) - 2 freq hopeful (2) - 10 freq howpfully (2) - 6 freq waefully (3) - 4 freq ruefully (3) - 3 freq joyfully (3) - 1 freq carefully (3) - 40 freq powerfully (3) - 1 freq forcefully (3) - 4 freq shamefully (3) - 2 freq helpfully (3) - 1 freq hopefu (3) - 11 freq gleefully (3) - 6 freq dootfully (3) - 2 freq dutifully (4) - 3 freq manfully (4) - 1 freq hoopful (4) - 3 freq fitfully (4) - 1 freq homely (4) - 2 freq fully (4) - 66 freq cairfully (4) - 4 freq wistfully (4) - 3 freq |
hopefully (0) - 60 freq hoopfully (2) - 2 freq hopeful (3) - 10 freq howpfully (3) - 6 freq hatefully (3) - 1 freq helpfully (4) - 1 freq woefully (4) - 2 freq hopefu (5) - 11 freq gleefully (5) - 6 freq hoopful (5) - 3 freq howpfullie (5) - 1 freq dootfully (5) - 2 freq shamefully (5) - 2 freq waefully (5) - 4 freq joyfully (5) - 1 freq ruefully (5) - 3 freq carefully (5) - 40 freq helly (6) - 16 freq rope'll (6) - 1 freq pully (6) - 2 freq cheerfully (6) - 4 freq hateful (6) - 4 freq refull (6) - 1 freq pitifully (6) - 1 freq spitefully (6) - 2 freq |
SoundEx code - H114 hopefully - 60 freq hopeful - 10 freq heavy-built - 1 freq hypobole - 1 freq |
MetaPhone code - HPFL hopefully - 60 freq hopeful - 10 freq howpfully - 6 freq hoopful - 3 freq howpfullie - 1 freq hoopfully - 2 freq |
HOPEFULLY |
| Time to execute Levenshtein function - 0.185252 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.342019 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.027796 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.037793 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.000913 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. |