Robotic machine learning of anaphora
暂无分享,去创建一个
Our contribution tackles the problem of learning to understand anaphoric references in the context of robotic machine learning; e.g. Get the large screw. Put it in the left hole. Our solution assumes the probabilistic theory of learning spelt out in earlier publications. Associations are formed probabilistically between constituents of the verbal command and constituents of a presupposed internal representation. The theory is extended, as a first step, to anaphora by learning how to distinguish between incorrect surface depth and the correct tree-structure depth of the anaphoric references.
[1] Patrick Suppes,et al. Complexity Issues in Robotic Machine Learning of Natural Language , 1992 .
[2] Patrick Suppes,et al. Comprehension grammars generated from machine learning of natural languages , 1995, Machine Learning.
[3] Patrick Suppes,et al. Machine Learning Comprehension Grammars for Ten Languages , 1996, Comput. Linguistics.
[4] Richard M. Smaby. Ambiguous Coreference with Quantifiers , 1978 .