Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
grycefu (0) - 1 freq gracefu (1) - 5 freq gryce (2) - 1 freq gracefu' (2) - 1 freq grytfu (2) - 1 freq gratefu (2) - 28 freq graceful (2) - 10 freq grocery (3) - 4 freq brycey (3) - 4 freq graced (3) - 4 freq grocer (3) - 3 freq grief (3) - 113 freq graces (3) - 16 freq graces' (3) - 1 freq pacefu (3) - 1 freq grace's (3) - 3 freq grytely (3) - 2 freq grcu (3) - 1 freq paecefu (3) - 1 freq groce (3) - 4 freq gryte (3) - 68 freq grateful (3) - 33 freq greef (3) - 1 freq griefs (3) - 2 freq gracefae (3) - 1 freq |
grycefu (0) - 1 freq gracefu (1) - 5 freq graceful (3) - 10 freq gracefae (3) - 1 freq gratefu (3) - 28 freq gryce (3) - 1 freq grytfu (3) - 1 freq gracefu' (3) - 1 freq groce (4) - 4 freq grcu (4) - 1 freq grace (4) - 155 freq greef (4) - 1 freq greatfu (4) - 1 freq greff (4) - 6 freq forcefu (4) - 1 freq grief (4) - 113 freq graced (4) - 4 freq grocery (4) - 4 freq grocer (4) - 3 freq graces (4) - 16 freq grefe (4) - 2 freq grice (4) - 38 freq grecian (5) - 1 freq rcf (5) - 1 freq pridefu (5) - 6 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 - KRSF gracefu' - 1 freq gracefae - 1 freq crucify - 1 freq krassivy - 1 freq gracefu - 5 freq greesaugh - 1 freq crucyfie - 2 freq crucifee - 2 freq course-'if - 1 freq grycefu - 1 freq cursive - 2 freq corrosive - 1 freq krzwyf - 1 freq |
GRYCEFU |
Time to execute Levenshtein function - 0.353283 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.620281 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.060026 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.041241 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.001083 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. |