The teachable language comprehender: a simulation program and theory of language
Communications of the ACM
Toward A Model Of Children''s Story Comprehension
Toward A Model Of Children''s Story Comprehension
Three properties of the ideal reader
Three properties of the ideal reader
Some Problems and Proposals for Knowledge Representation
Some Problems and Proposals for Knowledge Representation
Script application: computer understanding of newspaper stories.
Script application: computer understanding of newspaper stories.
Understanding goal-based stories.
Understanding goal-based stories.
Adaptive understanding: correcting erroneous inferences
Adaptive understanding: correcting erroneous inferences
A unified theory of inference for text understanding
A unified theory of inference for text understanding
Frame activated inferences in a story understanding program
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Margie memory, analysis, response generation, and inference on English
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
A probabilistic analysis of marker-passing techniques for plan-recognition
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
Computational Linguistics
| Hi-index | 0.00 |
The problem of deciding what was implied by a written text, of "reading between the lines" is the problem of inference. To extract proper inferences from a text requires a great deal of general knowledge on the part of the reader. Past approaches have often postulated an algorithm tuned to process a particular kind of knowledge structure (such as a script, or a plan). An alternative, unified approach is proposed. The algorithm recognizes six very general classes of inference, classes that are not dependent on individual knowledge structures, but instead rely on patterns of connectivity between concepts. The complexity has been effectively shifted from the algorithm to the knowledge base; new kinds of knowledge structures can be added without modifying the algorithm.