| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gratefull (0) - 2 freq grateful (1) - 33 freq gratefully (1) - 3 freq gratefu' (2) - 1 freq graceful (2) - 10 freq gracefully (2) - 6 freq gratefil (2) - 1 freq gratetul (2) - 1 freq gratefu (2) - 28 freq grateffu (3) - 1 freq gratfu' (3) - 1 freq gracefu (3) - 5 freq hateful (3) - 4 freq refull (3) - 1 freq graetful (3) - 1 freq grief'll (3) - 1 freq gracefu' (3) - 1 freq hatefully (3) - 1 freq ungrateful (3) - 3 freq fateful (3) - 3 freq gratefoo (3) - 4 freq ranegill (4) - 1 freq greatfu (4) - 1 freq rattult (4) - 2 freq latefund (4) - 1 freq |
gratefull (0) - 2 freq gratefully (1) - 3 freq grateful (2) - 33 freq gracefully (3) - 6 freq gratefil (3) - 1 freq gratefu' (4) - 1 freq graceful (4) - 10 freq gratefu (4) - 28 freq gratetul (4) - 1 freq graetful (4) - 1 freq hatefully (5) - 1 freq gratefoo (5) - 4 freq ungrateful (5) - 3 freq grief'll (5) - 1 freq refull (5) - 1 freq gratfu' (5) - 1 freq grateffu (5) - 1 freq gravelly (6) - 3 freq gretel (6) - 2 freq ruefully (6) - 3 freq prayfully (6) - 6 freq brautiful (6) - 1 freq graetly (6) - 1 freq grytely (6) - 2 freq prayeefully (6) - 1 freq |
SoundEx code - G631 grateful - 33 freq gratfu' - 1 freq gratefu - 28 freq gratified - 1 freq gratefoo - 4 freq gratefoo's - 1 freq gratefu' - 1 freq gratefully - 3 freq girthpooch - 1 freq gratefil - 1 freq grotti-buckie - 1 freq grottie-buckie - 6 freq grottie-buckie's - 2 freq graetful - 1 freq gardyveen - 2 freq gratefull - 2 freq gratification - 1 freq grateffu - 1 freq grytfu - 1 freq growed-up - 1 freq growed-ups - 1 freq guard-pickets - 1 freq greatfu - 1 freq greattv - 1 freq gqkourdfug - 1 freq grottybuckies - 1 freq garethbale - 1 freq |
MetaPhone code - KRTFL grateful - 33 freq gratefully - 3 freq creatively - 5 freq gratefil - 1 freq graetful - 1 freq gratefull - 2 freq creativelie - 1 freq creativly - 1 freq |
GRATEFULL |
| Time to execute Levenshtein function - 0.276731 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.465013 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.032178 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.047948 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.001018 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. |