Extension of grounding mechanism for abstract words: computational methods insights

摘要

The attempts to model cognitive phenomena effectively have split the research community in two paradigms: symbolic and connectionist. The extension of grounding phenomenon for abstract words is very important for social interactions of cognitive robots in real scenarios. This paper reviews the strength of symbolic and connectionist methods to address the abstract word grounding problem in cognitive robots. In particular, the presented work is focused on designing and simulating cognitive robotics model to achieve a grounding mechanism for abstract words by using the semantic network approach, as well as examining the utility of connectionist computation for the same problem. Two neuro-robotics models based on feed forward neural network and recurrent neural network are presented to see the pros and cons of connectionist approach. The simulation results and review of attributes of these methods reveal that the proposed symbolic model offers the solution to the problem of grounding abstract words with attributes like high data storage capacity with recall accuracy, structural integrity and temporal sequence handling. Whereas, connectionist computation based solutions give more natural solution to this problem with some shortcomings that include combinatorial ambiguity, low storage capacity and structural rigidity. The presented results are not only important for the advancement in communication system of cognitive robot, also provide evidence for embodied nature of abstract language.