Inferential memory as the basis of machines which understand natural language
Computers & thought
Natural language question-answering systems: 1969
Communications of the ACM
A deductive question-answerer for natural language inference
Communications of the ACM
The teachable language comprehender: a simulation program and theory of language
Communications of the ACM
ELIZA—a computer program for the study of natural language communication between man and machine
Communications of the ACM
| Hi-index | 48.22 |
MUSE is a computer model for natural language processing, based on a semantic memory network like that of Quillian's TLC. MUSE, from a Model to Understand Simple English, processes English sentences of unrestricted content but somewhat restricted format. The model first applies syntactic analysis to eliminate some interpretations and then employs a simplified semantic intersection procedure to find a valid interpretation of the input. While the semantic processing is similar to TLC's, the syntactic component includes the early use of parse trees and special purpose rules. The “relational triple” notation used during interpretation of input is compatible with MUSE's memory structures, allowing direct verification of familiar concepts and the addition of new ones. MUSE also has a repertoire of actions, which range from editing and reporting the contents of its own memory to an indirect form of question answering. Examples are presented to demonstrate how the model interprets text, resolves ambiguities, adds information to memory, generalizes from examples, and performs various actions.