| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gubbed (0) - 10 freq gobbed (1) - 3 freq dubbed (1) - 2 freq grubbed (1) - 1 freq rubbed (1) - 42 freq gutted (2) - 32 freq jabbed (2) - 3 freq robbed (2) - 16 freq snubbed (2) - 1 freq libbed (2) - 1 freq gabbled (2) - 1 freq gulped (2) - 7 freq cubberd (2) - 1 freq sunbed (2) - 2 freq babbed (2) - 1 freq rubber (2) - 54 freq gunked (2) - 1 freq stubbed (2) - 3 freq globed (2) - 1 freq gued (2) - 1 freq ribbed (2) - 2 freq gibbet (2) - 5 freq mobbed (2) - 6 freq gunned (2) - 1 freq gobbled (2) - 4 freq |
gubbed (0) - 10 freq gobbed (1) - 3 freq grubbed (2) - 1 freq rubbed (2) - 42 freq dubbed (2) - 2 freq gibbet (3) - 5 freq mobbed (3) - 6 freq ribbed (3) - 2 freq nebbed (3) - 2 freq globed (3) - 1 freq nabbed (3) - 8 freq grabbed (3) - 77 freq gubbin (3) - 3 freq jibbed (3) - 1 freq lobbed (3) - 6 freq sobbed (3) - 7 freq gobbled (3) - 4 freq babbed (3) - 1 freq libbed (3) - 1 freq sabbed (3) - 5 freq robbed (3) - 16 freq jabbed (3) - 3 freq gabbled (3) - 1 freq bobbed (3) - 1 freq garbed (3) - 3 freq |
SoundEx code - G130 gawped - 32 freq gift - 116 freq goaved - 7 freq gawpit - 10 freq gowped - 5 freq gowpit - 10 freq gowpt - 1 freq gawpt - 1 freq gypit - 20 freq giveth - 2 freq gyped - 1 freq gobbit - 1 freq gibbet - 5 freq gauped - 2 freq gubbed - 10 freq geppetto - 1 freq giftie - 8 freq guffawed - 2 freq gïft - 1 freq gobbed - 3 freq gupta - 1 freq guffed - 4 freq gooped - 1 freq gaffed - 13 freq goved - 2 freq gaeped - 1 freq gabbit - 3 freq gibt - 3 freq govit - 1 freq gavotte - 1 freq gaped - 3 freq €œgift - 1 freq gapit - 1 freq giepit - 5 freq govt - 7 freq gbuta - 1 freq gypehied - 1 freq gvht - 1 freq |
MetaPhone code - KBT gobbit - 1 freq gubbed - 10 freq gobbed - 3 freq gabbit - 3 freq qbt - 1 freq cbd - 1 freq gbuta - 1 freq kbd - 1 freq |
GUBBED |
| Time to execute Levenshtein function - 0.292059 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.761012 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.027094 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.085892 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.000803 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. |