| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goblin (0) - 9 freq gobblin (1) - 1 freq gorblin (1) - 2 freq goblins (1) - 1 freq godlin (1) - 1 freq gowlin (1) - 15 freq colin (2) - 63 freq houlin (2) - 21 freq lobbin (2) - 4 freq cobain (2) - 1 freq gubbin (2) - 3 freq goolie (2) - 1 freq roslin (2) - 1 freq rollin (2) - 58 freq rowlin (2) - 4 freq toolin (2) - 1 freq yorlin (2) - 12 freq fowlin (2) - 1 freq gowlan (2) - 1 freq googlin (2) - 7 freq gosling (2) - 1 freq 'blin (2) - 1 freq gabblin (2) - 4 freq gobbling (2) - 1 freq boilin (2) - 6 freq |
goblin (0) - 9 freq gobblin (2) - 1 freq godlin (2) - 1 freq gowlin (2) - 15 freq goblins (2) - 1 freq gorblin (2) - 2 freq boilin (3) - 6 freq gabblin (3) - 4 freq googlin (3) - 7 freq gemblin (3) - 1 freq 'blin (3) - 1 freq cablin (3) - 1 freq gamblin (3) - 9 freq siblin (3) - 1 freq boolin (3) - 16 freq gowlan (3) - 1 freq dublin (3) - 29 freq gealin (3) - 1 freq gobban (3) - 1 freq goblet (3) - 1 freq amblin (3) - 3 freq gubbin (3) - 3 freq gabbin (3) - 19 freq doublin (3) - 6 freq blin (3) - 116 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.207115 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.357227 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.027653 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.038506 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.001006 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. |