Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
grabbin (0) - 29 freq grabbing (1) - 4 freq grabbid (1) - 3 freq grabben (1) - 1 freq gabbin (1) - 19 freq grabbit (1) - 28 freq grabban (1) - 1 freq grabbie (1) - 3 freq grabblin (1) - 1 freq robbin (2) - 5 freq dabbin (2) - 7 freq rabbit (2) - 499 freq graftin (2) - 6 freq erabbit (2) - 1 freq jabbin (2) - 7 freq sabbin (2) - 10 freq grabby (2) - 1 freq thrabbin (2) - 4 freq grassin (2) - 2 freq grabbed (2) - 77 freq scrabbin (2) - 1 freq wabbin (2) - 1 freq grain (2) - 77 freq babbin (2) - 4 freq ribbin (2) - 2 freq |
grabbin (0) - 29 freq grabben (1) - 1 freq grabban (1) - 1 freq grabblin (2) - 1 freq grabbing (2) - 4 freq grabbid (2) - 3 freq grabbie (2) - 3 freq gabbin (2) - 19 freq grabbit (2) - 28 freq cribbin (3) - 1 freq grabbed (3) - 77 freq rubbin (3) - 48 freq grabby (3) - 1 freq gubbin (3) - 3 freq ribbin (3) - 2 freq robbin (3) - 5 freq grazin (4) - 11 freq nabbin (4) - 2 freq crabbit (4) - 106 freq gabbie (4) - 1 freq gabblin (4) - 4 freq grantin (4) - 2 freq gabbit (4) - 3 freq ribbon (4) - 21 freq grubby (4) - 2 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 - KRBN grabbin - 29 freq caribbean - 3 freq grabben - 1 freq corbyn - 8 freq cribbin - 1 freq grabban - 1 freq carbon - 7 freq |
GRABBIN |
Time to execute Levenshtein function - 0.400572 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.822342 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.087330 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.100096 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.000867 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. |