| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gobblin (0) - 1 freq wobblin (1) - 3 freq gorblin (1) - 2 freq goblin (1) - 9 freq gabblin (1) - 4 freq gobbling (1) - 1 freq hobblin (1) - 2 freq googlin (2) - 7 freq gobban (2) - 1 freq bibblin (2) - 2 freq doublin (2) - 6 freq jibblin (2) - 1 freq gobbled (2) - 4 freq gowlin (2) - 15 freq yabblin (2) - 2 freq mobbin (2) - 1 freq sobbin (2) - 10 freq gabbling (2) - 1 freq bobbin (2) - 22 freq hobbling (2) - 1 freq gobbins (2) - 3 freq gamblin (2) - 9 freq nabblin (2) - 1 freq lobbyin (2) - 2 freq bubblin (2) - 29 freq |
gobblin (0) - 1 freq gabblin (1) - 4 freq hobblin (2) - 2 freq gobbling (2) - 1 freq wobblin (2) - 3 freq goblin (2) - 9 freq gorblin (2) - 2 freq grabblin (3) - 1 freq nabblin (3) - 1 freq gemblin (3) - 1 freq bubblin (3) - 29 freq gamblin (3) - 9 freq nibblin (3) - 7 freq gubbin (3) - 3 freq wabblin (3) - 5 freq dibblin (3) - 1 freq gobble (3) - 3 freq mbblin (3) - 1 freq yabblin (3) - 2 freq babblin (3) - 2 freq bibblin (3) - 2 freq gobban (3) - 1 freq jibblin (3) - 1 freq gobbled (3) - 4 freq gabbling (3) - 1 freq |
SoundEx code - G145 gable-end - 1 freq gabblin - 4 freq gavel-en - 2 freq gable-en - 2 freq gable-ens - 1 freq goblins - 1 freq gobblin - 1 freq goblin - 9 freq gobbling - 1 freq gabbling - 1 freq gboylandjkd - 1 freq gblenrkdla - 1 freq |
MetaPhone code - KBLN gabblin - 4 freq gable-en - 2 freq gobblin - 1 freq goblin - 9 freq cablin - 1 freq |
GOBBLIN |
| Time to execute Levenshtein function - 0.173598 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.336654 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.030513 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.045001 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.001152 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. |