| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| howpfully (0) - 6 freq hoopfully (1) - 2 freq hopefully (2) - 59 freq howpfullie (2) - 1 freq helpfully (2) - 1 freq hoopful (3) - 3 freq joyfully (3) - 1 freq woefully (3) - 2 freq lawfully (3) - 3 freq howpasley (3) - 21 freq awfully (3) - 12 freq powerfully (3) - 1 freq hatefully (3) - 1 freq howpfu (3) - 20 freq dootfully (3) - 2 freq hourly (4) - 1 freq prayfully (4) - 6 freq howpfie (4) - 1 freq tuinfully (4) - 1 freq playfully (4) - 3 freq wully (4) - 127 freq pitifully (4) - 1 freq tankfully (4) - 2 freq towtful (4) - 1 freq dutifully (4) - 3 freq |
howpfully (0) - 6 freq hoopfully (2) - 2 freq howpfullie (2) - 1 freq helpfully (3) - 1 freq hopefully (3) - 59 freq powerfully (5) - 1 freq hatefully (5) - 1 freq howpfu (5) - 20 freq howpasley (5) - 21 freq awfully (5) - 12 freq hoopful (5) - 3 freq woefully (5) - 2 freq lawfully (5) - 3 freq hopeful (6) - 10 freq howpfae (6) - 1 freq powerfull (6) - 1 freq helpful (6) - 6 freq awfull (6) - 2 freq waefully (6) - 4 freq downfall (6) - 1 freq wilfully (6) - 1 freq unhelpfully (6) - 1 freq joyfully (6) - 1 freq dootfully (6) - 2 freq howpfie (6) - 1 freq |
SoundEx code - H140 huffily - 3 freq happily - 40 freq hauflie - 1 freq 'hevylie - 1 freq hayvul - 1 freq howpfully - 6 freq heavily - 8 freq hoopful - 3 freq habile - 6 freq hovel - 4 freq 'hovel' - 1 freq habble - 2 freq happilie - 1 freq howpfullie - 1 freq hubble - 3 freq habbil - 1 freq hoopfully - 2 freq hvl - 2 freq |
MetaPhone code - HPFL hopefully - 59 freq hopeful - 10 freq howpfully - 6 freq hoopful - 3 freq howpfullie - 1 freq hoopfully - 2 freq |
HOWPFULLY |
| Time to execute Levenshtein function - 0.211777 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.396525 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.062955 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.047185 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.001120 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. |