| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grespin (0) - 3 freq respin (1) - 1 freq graspin (1) - 7 freq glessin (2) - 1 freq gremlin (2) - 4 freq gruppin (2) - 19 freq rispin (2) - 1 freq graipin (2) - 3 freq greein (2) - 3 freq dressin (2) - 23 freq grectin (2) - 1 freq gespan (2) - 1 freq pressin (2) - 25 freq gaspin (2) - 13 freq gripin (2) - 1 freq guessin (2) - 18 freq resin (2) - 6 freq grenein (2) - 1 freq restin (2) - 29 freq grein (2) - 4 freq groupin (2) - 1 freq gresp (2) - 2 freq dreipin (2) - 4 freq graspit (2) - 3 freq grassin (2) - 2 freq |
grespin (0) - 3 freq graspin (1) - 7 freq respin (2) - 1 freq graispin (2) - 2 freq gresp (3) - 2 freq raspin (3) - 5 freq gresped (3) - 1 freq groupin (3) - 1 freq grassin (3) - 2 freq grushin (3) - 1 freq respon (3) - 1 freq grippin (3) - 21 freq gripin (3) - 1 freq graspit (3) - 3 freq gaspin (3) - 13 freq graipin (3) - 3 freq rispin (3) - 1 freq gruppin (3) - 19 freq graspin' (3) - 2 freq gropin (3) - 2 freq grasping (3) - 2 freq gespan (3) - 1 freq dreepin (4) - 63 freq greetin (4) - 362 freq grippan (4) - 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 - KRSPN graspin - 7 freq graispin - 2 freq graspin' - 2 freq grespin - 3 freq |
GRESPIN |
| Time to execute Levenshtein function - 0.271233 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.445933 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.029757 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.040647 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.000790 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. |