| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grasp (0) - 27 freq gras (1) - 5 freq rasp (1) - 11 freq gasp (1) - 37 freq gresp (1) - 2 freq graip (1) - 5 freq grass (1) - 101 freq graft (2) - 35 freq crisp (2) - 42 freq graw (2) - 11 freq grant (2) - 101 freq arase (2) - 1 freq graws (2) - 4 freq gap (2) - 49 freq gress (2) - 199 freq rash (2) - 11 freq grist (2) - 35 freq yasp (2) - 1 freq raspy (2) - 2 freq frast (2) - 1 freq gaap (2) - 1 freq grup (2) - 52 freq clasp (2) - 7 freq groop (2) - 1 freq brast (2) - 1 freq |
grasp (0) - 27 freq gresp (1) - 2 freq graip (2) - 5 freq grass (2) - 101 freq gras (2) - 5 freq rasp (2) - 11 freq gasp (2) - 37 freq grose (3) - 1 freq gris (3) - 1 freq grump (3) - 3 freq gausp (3) - 2 freq group (3) - 332 freq granpa (3) - 1 freq graspin (3) - 7 freq greasy (3) - 23 freq gruip (3) - 1 freq grassy (3) - 7 freq gros (3) - 8 freq grays (3) - 2 freq grasse (3) - 1 freq grush (3) - 1 freq risp (3) - 2 freq grease (3) - 12 freq greast (3) - 1 freq grupp (3) - 2 freq |
SoundEx code - G621 graceful - 10 freq graspin - 7 freq gracefu' - 1 freq graspit - 3 freq grasp - 27 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 - KRSP crisp - 42 freq crispy - 10 freq grasp - 27 freq gresp - 2 freq krispy - 4 freq |
GRASP |
| Time to execute Levenshtein function - 0.171925 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.348737 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.027387 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.036441 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.000811 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. |