| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grasped (0) - 3 freq gasped (1) - 21 freq gresped (1) - 1 freq rasped (1) - 3 freq grassed (1) - 5 freq raiped (2) - 5 freq greased (2) - 3 freq trapped (2) - 24 freq risped (2) - 1 freq graced (2) - 4 freq gawped (2) - 32 freq graded (2) - 3 freq draped (2) - 16 freq grasse (2) - 1 freq crapped (2) - 1 freq grushed (2) - 1 freq grasses (2) - 8 freq grained (2) - 4 freq wrapped (2) - 55 freq grazed (2) - 5 freq graved (2) - 1 freq cramped (2) - 2 freq grated (2) - 1 freq grasser (2) - 1 freq gaped (2) - 3 freq |
grasped (0) - 3 freq gresped (1) - 1 freq grospied (2) - 1 freq grassed (2) - 5 freq rasped (2) - 3 freq gasped (2) - 21 freq grouped (3) - 1 freq grupped (3) - 8 freq graspin (3) - 8 freq groaped (3) - 1 freq graspit (3) - 3 freq grushed (3) - 1 freq gripped (3) - 19 freq grayssed (3) - 1 freq groped (3) - 1 freq griped (3) - 1 freq grasp (3) - 28 freq risped (3) - 1 freq greased (3) - 3 freq gaeped (4) - 1 freq rapped (4) - 4 freq graispin (4) - 2 freq crashed (4) - 28 freq gossiped (4) - 1 freq grespin (4) - 3 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 - KRSPT graspit - 3 freq grasped - 3 freq gresped - 1 freq grospied - 1 freq crusepat - 3 freq |
GRASPED |
| Time to execute Levenshtein function - 0.206380 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.382408 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.028923 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.038765 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.000916 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. |