| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| graspable (0) - 1 freq tradable (3) - 1 freq prestable (3) - 2 freq capable (3) - 25 freq greeable (3) - 4 freq guessable (3) - 1 freq grasp'll (3) - 1 freq adappable (3) - 1 freq caapable (3) - 1 freq traceable (3) - 1 freq palpable (3) - 3 freq grapple (3) - 2 freq gangable (3) - 1 freq gradual (4) - 6 freq sable (4) - 2 freq gamble (4) - 13 freq rascally (4) - 1 freq rabble (4) - 10 freq grasped (4) - 3 freq friable (4) - 2 freq constable (4) - 24 freq variable (4) - 5 freq gristle (4) - 3 freq peaceable (4) - 2 freq grasse (4) - 1 freq |
graspable (0) - 1 freq grapple (5) - 2 freq grasp'll (5) - 1 freq greeable (5) - 4 freq guessable (5) - 1 freq prestable (5) - 2 freq raisonable (6) - 1 freq gristle (6) - 3 freq graspin' (6) - 2 freq agreeable (6) - 3 freq graspit (6) - 3 freq reasonable (6) - 21 freq grasping (6) - 2 freq grumble (6) - 9 freq grasp (6) - 28 freq grasped (6) - 3 freq raesonable (6) - 1 freq resemble (6) - 3 freq traceable (6) - 1 freq palpable (6) - 3 freq gangable (6) - 1 freq caapable (6) - 1 freq adappable (6) - 1 freq tradable (6) - 1 freq capable (6) - 25 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 - KRSPBL graspable - 1 freq |
GRASPABLE |
| Time to execute Levenshtein function - 0.191569 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.373911 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.031082 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.049533 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.000947 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. |