| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goblet (0) - 1 freq gibbet (2) - 5 freq gobbled (2) - 4 freq gobbed (2) - 3 freq gobbit (2) - 1 freq boglet (2) - 1 freq goblin (2) - 9 freq houlet (2) - 9 freq golem (2) - 1 freq gable (2) - 8 freq ootlet (2) - 4 freq cobles (2) - 2 freq gullet (2) - 5 freq cobblet (2) - 1 freq coble (2) - 5 freq voilet (2) - 1 freq gobble (2) - 3 freq gowlit (2) - 1 freq nobles (2) - 7 freq poulet (2) - 1 freq toilet (2) - 91 freq tablet (2) - 23 freq gollert (2) - 7 freq noble (2) - 30 freq gowl't (2) - 1 freq |
goblet (0) - 1 freq tablet (3) - 23 freq gullet (3) - 5 freq gibbet (3) - 5 freq gabblet (3) - 1 freq gowlt (3) - 19 freq gowlit (3) - 1 freq gimlet (3) - 1 freq gable (3) - 8 freq gobbit (3) - 1 freq dooblet (3) - 2 freq gables (3) - 4 freq gibblet (3) - 1 freq goblin (3) - 9 freq giblets (3) - 1 freq gablos (4) - 1 freq guilt (4) - 36 freq bleat (4) - 5 freq gfylt (4) - 1 freq geelit (4) - 1 freq boolt (4) - 1 freq geelt (4) - 2 freq doublt (4) - 2 freq glit (4) - 1 freq gilt (4) - 2 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 - 12 freq gabbled - 1 freq goblet - 1 freq gobbled - 4 freq cobalt - 1 freq cobblet - 1 freq gabblet - 1 freq |
GOBLET |
| Time to execute Levenshtein function - 0.246693 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.443391 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.027536 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.037640 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.000886 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. |