| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unhelpfully (0) - 1 freq unhelpful (2) - 1 freq helpfully (2) - 1 freq unhelpfu (3) - 1 freq cheerfully (4) - 4 freq thenkfully (4) - 1 freq hoopfully (4) - 2 freq helpful (4) - 6 freq howpfully (4) - 6 freq fearfully (5) - 3 freq leidfully (5) - 1 freq peetifully (5) - 2 freq cheerfilly (5) - 1 freq thankfully (5) - 28 freq wonderfully (5) - 1 freq hopefully (5) - 60 freq skillfully (5) - 1 freq skilfully (5) - 1 freq unselfishly (5) - 1 freq helpfu' (5) - 2 freq gleefully (5) - 6 freq underwuly (5) - 2 freq dreadfully (5) - 2 freq hullfulls (5) - 1 freq powerfully (5) - 1 freq |
unhelpfully (0) - 1 freq helpfully (3) - 1 freq unhelpful (3) - 1 freq unhelpfu (5) - 1 freq hoopfully (6) - 2 freq howpfully (6) - 6 freq helpful (6) - 6 freq hopefully (7) - 60 freq unlaufull (7) - 1 freq thenkfully (7) - 1 freq cheerfully (7) - 4 freq leafully (8) - 1 freq unhailly (8) - 1 freq hullfulls (8) - 1 freq thunkfully (8) - 1 freq shamefully (8) - 2 freq helpfu (8) - 21 freq howpfullie (8) - 1 freq hatefully (8) - 1 freq gleefully (8) - 6 freq helpfu' (8) - 2 freq thankfully (8) - 28 freq skilfully (8) - 1 freq skillfully (8) - 1 freq leidfully (8) - 1 freq |
SoundEx code - U541 unlawfu - 3 freq 'unlawfu - 1 freq unleavened - 1 freq unlippint - 1 freq unhelpful - 1 freq unlippent - 1 freq unlippened - 1 freq unilever - 2 freq unlawfu' - 1 freq unlaufull - 1 freq unlivin - 1 freq unhelpfu - 1 freq unhelpfully - 1 freq |
MetaPhone code - UNHLPFL unhelpful - 1 freq unhelpfully - 1 freq |
UNHELPFULLY |
| Time to execute Levenshtein function - 0.210348 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.397293 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.035177 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.042488 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.000872 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. |