Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
waefully (0) - 4 freq woefully (1) - 2 freq wilfully (2) - 1 freq hatefully (2) - 1 freq carefully (2) - 40 freq awfully (2) - 12 freq ruefully (2) - 3 freq manfully (2) - 1 freq lawfully (2) - 3 freq tankfully (3) - 2 freq joyfully (3) - 1 freq gratefully (3) - 3 freq wae'll (3) - 14 freq fearfully (3) - 3 freq wally (3) - 48 freq refull (3) - 1 freq cairfully (3) - 4 freq shamefully (3) - 2 freq waefu (3) - 25 freq fully (3) - 66 freq woeful (3) - 4 freq raelly (3) - 67 freq welly (3) - 5 freq wobully (3) - 1 freq hopefully (3) - 60 freq |
waefully (0) - 4 freq woefully (1) - 2 freq awfully (2) - 12 freq ruefully (3) - 3 freq lawfully (3) - 3 freq awfull (3) - 2 freq wilfully (3) - 1 freq fully (4) - 66 freq aafilly (4) - 1 freq woeful (4) - 4 freq welly (4) - 5 freq wully (4) - 127 freq waell (4) - 1 freq wobully (4) - 1 freq awfill (4) - 1 freq wally (4) - 48 freq refull (4) - 1 freq joyfully (4) - 1 freq carefully (4) - 40 freq leafully (4) - 1 freq wae'll (4) - 14 freq manfully (4) - 1 freq hatefully (4) - 1 freq aweful (5) - 1 freq weell (5) - 1 freq |
SoundEx code - W140 whauphill - 1 freq wife'll - 2 freq wobbly - 6 freq woeful - 4 freq wifely - 2 freq wabblie - 1 freq wabble - 3 freq wheeple - 2 freq weefla - 47 freq waffle - 8 freq waefully - 4 freq wheipil - 3 freq weffle - 1 freq wifle - 1 freq woful - 2 freq wobully - 1 freq weebly - 1 freq woefully - 2 freq wobble - 2 freq |
MetaPhone code - WFL whauphill - 1 freq wife'll - 2 freq woeful - 4 freq wifely - 2 freq weefla - 47 freq waffle - 8 freq waefully - 4 freq weffle - 1 freq wifle - 1 freq woful - 2 freq woefully - 2 freq |
WAEFULLY |
Time to execute Levenshtein function - 0.240873 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.464737 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.064010 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.041325 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.000848 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. |