| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kerfuully (0) - 1 freq ferfull (3) - 2 freq kerfuffle (3) - 2 freq fearfully (3) - 3 freq leafully (3) - 1 freq fuully (3) - 1 freq kerfuffled (4) - 1 freq veesually (4) - 1 freq awfully (4) - 12 freq powerfully (4) - 1 freq fitfully (4) - 1 freq verbally (4) - 1 freq ferful (4) - 2 freq virtually (4) - 13 freq perfeckly (4) - 5 freq lawfully (4) - 3 freq manfully (4) - 1 freq perfectly (4) - 44 freq refull (4) - 1 freq helpfully (4) - 1 freq equally (4) - 36 freq wilfully (4) - 1 freq nervously (4) - 31 freq fully (4) - 66 freq seriously (4) - 72 freq |
kerfuully (0) - 1 freq fearfully (4) - 3 freq ferfull (4) - 2 freq ruefully (5) - 3 freq carefully (5) - 40 freq refull (5) - 1 freq kerfl (5) - 1 freq cairfully (5) - 4 freq kerfuffle (5) - 2 freq fuully (5) - 1 freq leafully (5) - 1 freq cruelly (6) - 7 freq gleefully (6) - 6 freq waefully (6) - 4 freq mercifully (6) - 4 freq joyfully (6) - 1 freq skilfully (6) - 1 freq kirkill (6) - 1 freq prayfully (6) - 6 freq refill (6) - 3 freq kelly (6) - 144 freq foully (6) - 1 freq cheerfully (6) - 4 freq woefully (6) - 2 freq leidfully (6) - 1 freq |
SoundEx code - K614 kerfuully - 1 freq kerfl - 1 freq kerryfail - 1 freq |
MetaPhone code - KRFL carefully - 40 freq gravely - 12 freq careful - 43 freq grevel - 4 freq gravel - 9 freq criffel - 5 freq grovel - 3 freq grevvel - 1 freq grief'll - 1 freq gruffalo - 76 freq gruffal - 2 freq gravelly - 3 freq cairfully - 4 freq carefil - 1 freq gruffly - 2 freq graivel - 5 freq 'careful - 1 freq grove'll - 1 freq kerfuully - 1 freq carefuul - 1 freq kerfl - 1 freq cairavel - 1 freq craighall - 1 freq grevelly - 1 freq carefullie - 1 freq gruffalo' - 2 freq kerryfail - 1 freq |
KERFUULLY |
| Time to execute Levenshtein function - 0.223533 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.414205 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.031876 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.039871 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.000988 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. |