Open AccessApproaching the Symbol Grounding Problem with Probabilistic Graphical Models
Author(s) -
Tellex Stefanie,
Kollar Thomas,
Dickerson Steven,
Walter Matthew R.,
Banerjee Ashis Gopal,
Teller Seth,
Roy Nicholas
Publication year - 2011
Publication title -
ai magazine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.597
H-Index - 79
eISSN - 2371-9621
pISSN - 0738-4602
DOI - 10.1609/aimag.v32i4.2384
Subject(s) - computer science , probabilistic logic , symbol (formal) , robot , graphical model , artificial intelligence , sketch , ground , mobile robot , natural language , factor graph , inference , word (group theory) , natural language processing , human–computer interaction , programming language , engineering , linguistics , algorithm , philosophy , decoding methods , electrical engineering
In order for robots to engage in dialogue with human teammates, they must have the ability to identify correspondences between elements of language and aspects of the external world. A solution to this symbol‐grounding problem (Harnad, 1990) would enable a robot to interpret commands such as “Drive over to receiving and pick up the tire pallet.” This article describes several of our results that use probabilistic inference to address the symbol‐grounding problem. Our approach is to develop models that factor according to the linguistic structure of a command. We first describe an early result, a generative model that factors according to the sequential structure of language, and then discuss our new framework, generalized grounding graphs (G 3 ). The G 3 framework dynamically instantiates a probabilistic graphical model for a natural language input, enabling a mapping between words in language and concrete objects, places, paths, and events in the external world. We report on corpus‐based experiments in which the robot is able to learn and use word meanings in three real‐world tasks: indoor navigation, spatial language video retrieval, and mobile manipulation.