Understanding natural language

Abstract This paper describes a computer system for understanding English. The system answers questions, executes commands, and accepts information in an interactive English dialog. It is based on the belief that in modeling language understanding, we must deal in an integrated way with all of the aspects of language—syntax, semantics, and inference. The system contains a parser, a recognition grammar of English, programs for semantic analysis, and a general problem solving system. We assume that a computer cannot deal reasonably with language unless it can understand the subject it is discussing. Therefore, the program is given a detailed model of a particular domain. In addition, the system has a simple model of its own mentality. It can remember and discuss its plans and actions as well as carrying them out. It enters into a dialog with a person, responding to English sentences with actions and English replies, asking for clarification when its heuristic programs cannot understand a sentence through the use of syntactic, semantic, contextual, and physical knowledge. Knowledge in the system is represented in the form of procedures, rather than tables of rules or lists of patterns. By developing special procedural representations for syntax, semantics, and inference, we gain flexibility and power. Since each piece of knowledge can be a procedure, it can call directly on any other piece of knowledge in the system.

[1]  Frederick B. Thompson,et al.  English for the Computer , 1899 .

[2]  R. E. Long,et al.  An Approach Toward Answering English Questions from Text , 1899 .

[3]  Bert F. Green,et al.  Baseball: an automatic question-answerer , 1899, IRE-AIEE-ACM '61 (Western).

[4]  J. Fodor,et al.  The structure of a semantic theory , 1963 .

[5]  B. Raphael.  SIR: A COMPUTER PROGRAM FOR SEMANTIC INFORMATION RETRIEVAL , 1964 .

[6]  Daniel G. Bobrow,et al.  Natural Language Input for a Computer Problem Solving System , 1964 .

[7]  Arnold M. Zwicky,et al.  The mitre syntactic analysis procedure for transformational grammars , 1965, AFIPS '65 (Fall, part I).

[8]  Robert F. Simmons,et al.  Analyzing English syntax with a pattern-learning parser , 1965, CACM.

[9]  Jay C. Earley,et al.  Generating a recognizer for a BNF grammar , 1965 .

[10]  Stanley Roy Petrick,et al.  A recognition procedure for transformational grammars. , 1965 .

[11]  James R. Slagle,et al.  Experiments with a deductive question-answering program , 1965, CACM.

[12]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[13]  Susumu Kuno,et al.  The predictive analyzer and a path elimination technique , 1965, CACM.

[14]  Marvin Minsky,et al.  Matter, Mind and Models , 1965 .

[15]  Robert F. Simmons.  Storage and retrieval of aspects of meaning in directed graph structures , 1966, CACM.

[16]  A. V. Napalkov,et al.  COMPUTERS AND THOUGHT, EDITED BY E. A. FEIGENBAUM AND J. FELDMAN, NEW YORK, MCGRAW-HILL, 1963: BOOK REVIEW, , 1967 .

[17]  Joseph Weizenbaum,et al.  Contextual understanding by computers , 1967, CACM.

[18]  M. Halliday.  NOTES ON TRANSITIVITY AND THEME IN ENGLISH. PART 2 , 1967 .

[19]  Charles J. Fillmore,et al.  THE CASE FOR CASE. , 1967 .

[20]  William A. Woods,et al.  Procedural semantics for a question-answering machine , 1899, AFIPS Fall Joint Computing Conference.

[21]  L. Coles.  An on-line question-answering systems with natural language and pictorial input , 1968, ACM National Conference.

[22]  Terry Winograd,et al.  Linguistics and the computer analysis of tonal harmony , 1968 .

[23]  Gerard Salton,et al.  Automated Language Processing , 1968 .

[24]  Laurent Siklossy,et al.  Natural language learning by computer , 1968 .

[25]  Robert F. Simmons,et al.  A computational model of verbal understanding , 1899, AFIPS '68 (Fall, part I).

[26]  Bertram Raphael,et al.  The use of theorem-proving techniques in question-answering systems , 1968, ACM National Conference.

[27]  Charles Kellogg.  A natural language compiler for on-line data management , 1968, AFIPS '68 (Fall, part I).

[28]  Carl Hewitt,et al.  PLANNER: A Language for Proving Theorems in Robots , 1969, IJCAI.

[29]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[30]  Eugene Charniak,et al.  Computer Solution of Calculus Word Problems , 1969, IJCAI.

[31]  Gilbert K. Krulee,et al.  Using Relational Operators to Structure Long-Term Memory , 1969, IJCAI.

[32]  Paul Bratley,et al.  A program for the syntactic analysis of English sentences , 1969, CACM.

[33]  Stuart C. Shapiro,et al.  A Net Structure Based Relational Question Answerer: Description and Examples , 1969, IJCAI.

[34]  William A. Woods,et al.  Augmented Transition Networks for Natural Language Analysis. , 1969 .

[35]  Daniel G. Bobrow,et al.  An Augmented State Transition Network Analysis Procedure , 1969, IJCAI.

[36]  Gerald Jay Sussman,et al.  Micro-Planner Reference Manual , 1970 .

[37]  M. Halliday.  Functional diversity in language as seen from a consideration of modality and mood in English , 1970 .

[38]  Terry Winograd,et al.  Procedures As A Representation For Data In A Computer Program For Understanding Natural Language , 1971 .

[39]  Carl Hewitt,et al.  Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot , 1972 .

[40]  Marvin Minsky,et al.  Form and Content in Computer Science , 1972 .