Representing the Semantics of Natural Language as Constraint Expressions

The issue of how to represent the "meaning" of an utterance is central to the problem of computer understanding of natural language. Rather than relying on ad-hoc structures or forcing the complexities of natural language into mathematically elegant but computationally cumbersome representations (such as first-order logic), this paper presents a novel representation which has many desirable computational ahd logical properties. It is proposed to use this representation to structure the "world knowledge" of a natural-language understanding system. Working Papers are informal papers intended for internal use. CONTENTS 1 The general problem-domain 3 2 The proposed solution-domain 2.1 Experts 5 2.2 Some history 6 2.3 Advantages of a common representation 7 3 The conceptual layers 9 4 Using the high-level constructs 4.1 Entities (noun groups) 12 4. 2 Events and the case-frame hierarchy 13 4.3 Events and difference descriptions 15 4.4 Events, Minsky's frames, and defaults 15 4.5 Disambiguation-Domain-Range restrictions 18 5 Relation to other work 22 Appendix 25 Bibliography 1 The general problem-domain This project is primarily concerned with the "representation problem": How complex interrelated symbolic information can be structured so that a computer can use it "intelligently". For this project, the information to be structured is the "knowledge of the world" which a person must bring to bear in order to understand some simple natural language utterances (such as found in children's stories), and the "intelligent" use of such information is exactly this process of understanding. Following the lead of other Artificial Intelligence research into the problem of natural-language understanding (primarily Charniak [1972] and McDermott [1974a]), we can consider the computer to have "understood" an utterance if it can answer relevant questions from it. For example, consider the following story fragment from Charniak's thesis (the line numbers are for later reference): (1) Fred was going to the store. (2) Today was Jack's birthday (3) and Fred was going to get a present. Now consider some questions which might reasonably be asked: "Why did Fred go to the store?", and "Who is the present for?" For a human reader the answers are trivially obvious. However, in answering these questions, a significant amount of "knowledge of the world" must be used. The first question requires knowing that presents can be gotten at stores (so that "going to get a present" is sufficient motivation for "going to the store"), and the second requires knowing that one often gives presents to another on …

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

[2]  Peter A. Reich,et al.  Symbols, Relations, and Structural Complexity. , 1968 .

[3]  Drew McDermott,et al.  Assimilation of New Information by a Natural Language Understanding System , 1974 .

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

[5]  QuillianM. Ross The teachable language comprehender , 1969 .

[6]  Gerald Jay Sussman,et al.  The Conniver Reference Manual , 1972 .

[7]  Eugene Charniak,et al.  Toward a model of children's story comprehension , 1972 .

[8]  Scott E. Fahlman,et al.  A Hypothesis-Frame System for Recognition Problems , 1973 .

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

[10]  Marvin Minsky,et al.  A framework for representing knowledge , 1974 .

[11]  David L. Waltz,et al.  Generating Semantic Descriptions From Drawings of Scenes With Shadows , 1972 .

[12]  S. Lamb Linguistic and Cognitive Networks. , 1969 .

[13]  Drew McDermott Advice on the Fast-paced World of Electronics , 1974 .

[14]  Terry Winograd,et al.  FRAME REPRESENTATIONS AND THE DECLARATIVE/PROCEDURAL CONTROVERSY , 1975 .

[15]  E. F. Codd,et al.  The relational and network approaches: Comparison of the application programming interfaces , 1975, SIGFIDET '74.

[16]  Patrick Henry Winston,et al.  Learning structural descriptions from examples , 1970 .

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

[18]  Peter A. Reich,et al.  The English auxiliaries: A relational network description , 1970, Canadian Journal of Linguistics/Revue canadienne de linguistique.

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

[20]  Moshé M. Zloof Query by example , 1899 .

[21]  Bertram Raphael SIR: A COMPUTER PROGRAM FOR SEMANTIC INFORMATION RETRIEVAL , 1964 .

[22]  Roger C. Schank,et al.  Conceptual dependency: A theory of natural language understanding , 1972 .