| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| howpfullie (0) - 1 freq howpfully (2) - 6 freq hoopfully (3) - 2 freq howpfie (3) - 1 freq holywullie (3) - 1 freq hopefully (4) - 59 freq helpfully (4) - 1 freq howpfae (4) - 1 freq fullie (4) - 3 freq carefullie (4) - 1 freq hoopful (4) - 3 freq €œwullie (4) - 2 freq howpie (4) - 1 freq yoorwullie (4) - 5 freq waullie (4) - 2 freq oorwullie (4) - 2 freq wullie (4) - 416 freq howpfu (4) - 20 freq peullie (4) - 10 freq hostelrie (5) - 2 freq wulllie (5) - 1 freq houlin (5) - 21 freq fulyie (5) - 2 freq hollae (5) - 2 freq lawfully (5) - 3 freq |
howpfullie (0) - 1 freq howpfully (2) - 6 freq hoopfully (4) - 2 freq helpfully (5) - 1 freq hopefully (5) - 59 freq howpfie (5) - 1 freq howpfu (6) - 20 freq hoopful (6) - 3 freq holywullie (6) - 1 freq howpfae (6) - 1 freq lawfully (7) - 3 freq awfully (7) - 12 freq powerfull (7) - 1 freq downfall (7) - 1 freq hatefully (7) - 1 freq awfull (7) - 2 freq powerfully (7) - 1 freq howpasley (7) - 21 freq helpful (7) - 6 freq woefully (7) - 2 freq hopeful (7) - 10 freq howpie (7) - 1 freq yoorwullie (7) - 5 freq carefullie (7) - 1 freq oorwullie (7) - 2 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 |
HOWPFULLIE |
| Time to execute Levenshtein function - 0.220213 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.429393 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.028019 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.038175 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.000850 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. |