Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gobshite (0) - 7 freq gabshite (1) - 2 freq gob-shite (1) - 1 freq grushie (3) - 3 freq bobsmith (3) - 1 freq toshie (3) - 15 freq poshity (3) - 1 freq dog-shite (3) - 1 freq shite (3) - 322 freq bolshie (3) - 2 freq rooshie (3) - 1 freq gabsie (3) - 1 freq conshie (3) - 2 freq dogshit (3) - 2 freq gowstie (3) - 6 freq roushiae (3) - 3 freq wabsite (3) - 41 freq ootsite (3) - 1 freq gobbit (3) - 1 freq goustie (3) - 4 freq poshie (3) - 1 freq ootshine (3) - 3 freq website (3) - 54 freq roushie (3) - 17 freq golspie (3) - 1 freq |
gobshite (0) - 7 freq gabshite (1) - 2 freq gob-shite (2) - 1 freq goustie (5) - 4 freq website (5) - 54 freq wabsite (5) - 41 freq €˜shite (5) - 1 freq gobbit (5) - 1 freq panshite (5) - 1 freq ambushit (5) - 1 freq gushet (5) - 2 freq gowstie (5) - 6 freq glashie (5) - 1 freq 'shite (5) - 1 freq gunshot (5) - 2 freq shite (5) - 322 freq poshity (5) - 1 freq gabsie (5) - 1 freq dog-shite (5) - 1 freq grushie (5) - 3 freq dogshit (5) - 2 freq washte (6) - 1 freq gosh (6) - 2 freq gaspit (6) - 5 freq dashit (6) - 2 freq |
SoundEx code - G123 gippct - 1 freq gob-shite - 1 freq gubstappers - 3 freq gubstapper - 1 freq gobstoppers - 3 freq gabshite - 2 freq gavsterno - 2 freq gaavster - 1 freq gobshite - 7 freq gpfqd - 1 freq ggbcd - 1 freq gypsytravellers - 1 freq gypsytravellerm - 1 freq |
MetaPhone code - KBXT gob-shite - 1 freq gabshite - 2 freq gobshite - 7 freq |
GOBSHITE |
Time to execute Levenshtein function - 0.386825 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.776263 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.037116 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.091027 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.000795 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. |