Blondin-Massé, Alexandre, Chicoisne, Guillaume, Gargouri, Yassine, Harnad, Stevan, Picard, Olivier and Marcotte, Odile
How is meaning grounded in dictionary definitions?
At Coling 2008. 22nd International Conference on Computational Linguistics: TextGraphs-3 Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, United Kingdom.
16 - 24 Aug 2008.
Meaning cannot be based on dictionary def- initions all the way down: at some point the circularity of definitions must be bro- ken in some way, by grounding the mean- ings of certain words in sensorimotor cat- egories learned from experience or shaped by evolution. This is the “symbol ground- ing problem”. We introduce the concept of a reachable set — a larger vocabulary whose meanings can be learned from a smaller vo- cabulary through definition alone, as long as the meanings of the smaller vocabulary are themselves already grounded. We provide simple algorithms to compute reachable sets for any given dictionary.
Conference or Workshop Item
|Venue - Dates:
||Coling 2008. 22nd International Conference on Computational Linguistics: TextGraphs-3 Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, United Kingdom, 2008-08-16 - 2008-08-24
||Web & Internet Science
||05 Oct 2012 16:58
||17 Apr 2017 16:33
|Further Information:||Google Scholar|
Actions (login required)