| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goblin (0) - 9 freq gowlin (1) - 15 freq gobblin (1) - 1 freq gorblin (1) - 2 freq goblins (1) - 1 freq godlin (1) - 1 freq googlin (2) - 7 freq roilin (2) - 1 freq gobban (2) - 1 freq yorlin (2) - 12 freq foalin (2) - 1 freq hollin (2) - 1 freq rowlin (2) - 4 freq collin (2) - 2 freq wobblin (2) - 3 freq bobin (2) - 1 freq growlin (2) - 15 freq gowkin (2) - 2 freq ootlin (2) - 11 freq gorblie (2) - 2 freq gurlin (2) - 4 freq toilin (2) - 2 freq fobbin (2) - 3 freq goldin (2) - 1 freq gubbin (2) - 3 freq |
goblin (0) - 9 freq godlin (2) - 1 freq gorblin (2) - 2 freq goblins (2) - 1 freq gobblin (2) - 1 freq gowlin (2) - 15 freq siblin (3) - 1 freq amblin (3) - 2 freq dublin (3) - 29 freq 'blin (3) - 1 freq cablin (3) - 1 freq boolin (3) - 16 freq gealin (3) - 1 freq goblet (3) - 1 freq gabblin (3) - 4 freq gowlan (3) - 1 freq gemblin (3) - 1 freq gabbin (3) - 19 freq gubbin (3) - 3 freq doublin (3) - 6 freq blin (3) - 116 freq boilin (3) - 5 freq gamblin (3) - 9 freq gobban (3) - 1 freq gurlin (3) - 4 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 |
GOBLIN |
| Time to execute Levenshtein function - 0.204362 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.364964 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.027725 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.038331 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.001083 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. |