| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gabblet (0) - 1 freq gabbled (1) - 1 freq gibblet (1) - 1 freq gabblt (1) - 1 freq gabble (1) - 1 freq gambles (2) - 2 freq gable (2) - 8 freq gabblin (2) - 4 freq goblet (2) - 1 freq wabbles (2) - 1 freq gobble (2) - 3 freq wabble (2) - 3 freq gibbles (2) - 1 freq dabble (2) - 2 freq wabblit (2) - 1 freq garbled (2) - 2 freq habble (2) - 2 freq gabbie (2) - 1 freq taiblet (2) - 3 freq jabble (2) - 2 freq gambler (2) - 4 freq dabbled (2) - 1 freq tabulet (2) - 1 freq gibble (2) - 1 freq babble (2) - 2 freq |
gabblet (0) - 1 freq gibblet (1) - 1 freq gabblt (1) - 1 freq gabble (2) - 1 freq gabbled (2) - 1 freq wabblit (3) - 1 freq gobbled (3) - 4 freq cobblet (3) - 1 freq gabbit (3) - 3 freq gibble (3) - 1 freq gibbet (3) - 5 freq gibbles (3) - 1 freq goblet (3) - 1 freq gabblin (3) - 4 freq gobble (3) - 3 freq yabbled (4) - 1 freq tablet (4) - 25 freq gobblin (4) - 1 freq nibblt (4) - 1 freq babbled (4) - 2 freq gables (4) - 4 freq bubblit (4) - 1 freq gobbit (4) - 1 freq yabble (4) - 1 freq rabble (4) - 10 freq |
SoundEx code - G143 gabblt - 1 freq gabbled - 1 freq goblet - 1 freq gobbled - 4 freq gobbledegook - 1 freq giblets - 1 freq gobble-it-up - 1 freq geopolitical - 1 freq gibblet - 1 freq gabblet - 1 freq gfylt - 1 freq |
MetaPhone code - KBLT cobbl't - 1 freq gabblt - 1 freq cobbled - 13 freq gabbled - 1 freq goblet - 1 freq gobbled - 4 freq cobalt - 1 freq cobblet - 1 freq gabblet - 1 freq |
GABBLET |
| Time to execute Levenshtein function - 0.207379 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.386854 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.029323 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.039088 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.000905 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. |