| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grabbing (0) - 4 freq grabbin (1) - 29 freq gabbin (2) - 19 freq grazing (2) - 3 freq granting (2) - 1 freq stabbing (2) - 2 freq grassing (2) - 1 freq robbing (2) - 1 freq grabban (2) - 1 freq grasping (2) - 2 freq grabbid (2) - 3 freq grabben (2) - 1 freq grafting (2) - 2 freq grabblin (2) - 1 freq grabbit (2) - 28 freq grabbie (2) - 3 freq rubbing (2) - 3 freq gabbling (2) - 1 freq graint (3) - 4 freq fracking (3) - 1 freq gasping (3) - 2 freq gratins (3) - 1 freq babbling (3) - 2 freq grinning (3) - 5 freq rating (3) - 1 freq |
grabbing (0) - 4 freq grabbin (2) - 29 freq robbing (3) - 1 freq grabban (3) - 1 freq grabben (3) - 1 freq rubbing (3) - 3 freq grafting (4) - 2 freq grabblin (4) - 1 freq gribbenc (4) - 7 freq gabbling (4) - 1 freq grabbie (4) - 3 freq grabbit (4) - 28 freq grabbid (4) - 3 freq grazing (4) - 3 freq gabbin (4) - 19 freq stabbing (4) - 2 freq granting (4) - 1 freq grasping (4) - 2 freq grassing (4) - 1 freq greeting (5) - 11 freq greying (5) - 2 freq grabby (5) - 1 freq gobbling (5) - 1 freq gobbins (5) - 3 freq gruching (5) - 1 freq |
SoundEx code - G615 gryphon - 335 freq grabbin - 29 freq gruppin - 19 freq grabbing - 4 freq grippin - 21 freq gropin - 2 freq groping - 1 freq grievance - 1 freq grievin - 13 freq greving - 1 freq graivn - 1 freq grabben - 1 freq graipin - 3 freq gairravoone - 1 freq 'girvan - 1 freq grabbieness - 1 freq gryphons - 1 freq graphemes - 3 freq grapheme - 5 freq grabban - 1 freq gropeens - 1 freq grippan - 2 freq gripin - 1 freq graven - 1 freq groupin - 1 freq grippiness - 1 freq garfunkel - 2 freq greivin - 1 freq griffon - 1 freq grippin' - 1 freq gribbenc - 7 freq gyrfyimx - 1 freq griefencounter - 1 freq grieving - 1 freq girvanacademy - 1 freq |
MetaPhone code - KRBNK grabbing - 4 freq gribbenc - 7 freq |
GRABBING |
| Time to execute Levenshtein function - 0.231600 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.363632 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.027622 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.038008 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.000823 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. |