| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| graspin (0) - 7 freq graipin (1) - 3 freq graispin (1) - 2 freq raspin (1) - 5 freq grespin (1) - 3 freq gaspin (1) - 13 freq grasping (1) - 2 freq grassin (1) - 2 freq graspin' (1) - 2 freq graspit (1) - 3 freq crampin (2) - 2 freq gripin (2) - 1 freq grippin (2) - 21 freq grazin (2) - 11 freq gaapin (2) - 1 freq gapin (2) - 10 freq gampin (2) - 1 freq grampian (2) - 11 freq drapin (2) - 1 freq grabbin (2) - 29 freq rappin (2) - 6 freq rampin (2) - 4 freq rasin (2) - 1 freq drappin (2) - 67 freq grushin (2) - 1 freq |
graspin (0) - 7 freq grespin (1) - 3 freq graispin (1) - 2 freq graspin' (2) - 2 freq grasping (2) - 2 freq graspit (2) - 3 freq grassin (2) - 2 freq graipin (2) - 3 freq raspin (2) - 5 freq gaspin (2) - 13 freq grasp (3) - 27 freq rispin (3) - 1 freq gaspan (3) - 1 freq grushin (3) - 1 freq grampian (3) - 11 freq grasped (3) - 3 freq grippin (3) - 21 freq groupin (3) - 1 freq gripin (3) - 1 freq respin (3) - 1 freq gropin (3) - 2 freq raspan (3) - 1 freq gruppin (3) - 19 freq crappin (4) - 11 freq gratin (4) - 4 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 - KRSPN graspin - 7 freq graispin - 2 freq graspin' - 2 freq grespin - 3 freq |
GRASPIN |
| Time to execute Levenshtein function - 0.195510 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.374543 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.027110 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.038005 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.000783 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. |