| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| graceful (0) - 10 freq gracefu' (1) - 1 freq grateful (1) - 33 freq gracefu (1) - 5 freq grycefu (2) - 1 freq gracefully (2) - 6 freq gratetul (2) - 1 freq digraceful (2) - 1 freq gracefae (2) - 1 freq gratefil (2) - 1 freq gratefu (2) - 28 freq gratefu' (2) - 1 freq peaceful (2) - 22 freq graetful (2) - 1 freq gratefull (2) - 2 freq 'careful (3) - 1 freq gratefully (3) - 3 freq forceful (3) - 2 freq facefu (3) - 2 freq succeful (3) - 1 freq gratefoo (3) - 4 freq pacefu (3) - 1 freq gravel (3) - 9 freq peacefu (3) - 12 freq graces' (3) - 1 freq |
graceful (0) - 10 freq grateful (2) - 33 freq gracefu (2) - 5 freq gracefu' (2) - 1 freq gratefil (3) - 1 freq graetful (3) - 1 freq gracefae (3) - 1 freq gracefully (3) - 6 freq digraceful (3) - 1 freq grycefu (3) - 1 freq peaceful (4) - 22 freq forceful (4) - 2 freq gratefull (4) - 2 freq gratefu' (4) - 1 freq gratetul (4) - 1 freq gratefu (4) - 28 freq graces (5) - 16 freq grace's (5) - 3 freq fraerful (5) - 1 freq graciously (5) - 5 freq ungrateful (5) - 3 freq gratfu' (5) - 1 freq grace (5) - 155 freq gracielie (5) - 2 freq careful (5) - 43 freq |
SoundEx code - G621 graceful - 10 freq graspin - 8 freq gracefu' - 1 freq graspit - 3 freq grasp - 28 freq grasped - 3 freq gracefully - 6 freq graispin - 2 freq graspin' - 2 freq gresp - 2 freq grasp'll - 1 freq gracefae - 1 freq graspable - 1 freq grasshoppers - 1 freq gracefu - 5 freq gresshoppers - 1 freq gress-fed - 1 freq grasshopper - 3 freq grycefu - 1 freq gresped - 1 freq grospied - 1 freq grespin - 3 freq grasping - 2 freq gjrrqufl - 1 freq gracebrodie - 14 freq georgefoulkes - 6 freq georgebfoster - 1 freq georgebeedie - 1 freq gregcapital - 1 freq grogipher - 1 freq greasepaint - 1 freq greigspence - 1 freq georgiebestie - 1 freq |
MetaPhone code - KRSFL graceful - 10 freq gracefully - 6 freq crossfella - 1 freq |
GRACEFUL |
| Time to execute Levenshtein function - 0.220361 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.364107 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.027338 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.037061 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.000909 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. |