| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| graspin (0) - 8 freq grespin (1) - 3 freq gaspin (1) - 13 freq graispin (1) - 2 freq grassin (1) - 2 freq raspin (1) - 5 freq grasping (1) - 2 freq graspit (1) - 3 freq graspin' (1) - 2 freq graipin (1) - 3 freq rampin (2) - 4 freq crampin (2) - 2 freq raepin (2) - 3 freq claspin (2) - 7 freq gaspit (2) - 5 freq trashin (2) - 1 freq grasp (2) - 28 freq grasped (2) - 3 freq gruppin (2) - 19 freq gripin (2) - 1 freq grushin (2) - 1 freq gampin (2) - 1 freq grampian (2) - 11 freq grabbin (2) - 29 freq crashin (2) - 18 freq |
graspin (0) - 8 freq grespin (1) - 3 freq graispin (1) - 2 freq graspit (2) - 3 freq graspin' (2) - 2 freq grasping (2) - 2 freq graipin (2) - 3 freq raspin (2) - 5 freq gaspin (2) - 13 freq grassin (2) - 2 freq rispin (3) - 1 freq gropin (3) - 2 freq gaspan (3) - 1 freq grushin (3) - 1 freq raspan (3) - 1 freq gripin (3) - 1 freq groupin (3) - 1 freq respin (3) - 1 freq grippin (3) - 21 freq grampian (3) - 11 freq gruppin (3) - 19 freq grasped (3) - 3 freq grasp (3) - 28 freq graftin (4) - 6 freq rasin (4) - 1 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 - KRSPN graspin - 8 freq graispin - 2 freq graspin' - 2 freq grespin - 3 freq |
GRASPIN |
| Time to execute Levenshtein function - 0.189262 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.364563 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.027453 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.038655 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.000899 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. |