TAILIEUCHUNG - Báo cáo khoa học: "ASIMPLIFIED THEORY OF TENSE REPRESENTATIONS AND CONSTRAINTS ON THEIR COMPOSITION"

This paper proposes a set of representations for tenses and a set of constraints on how they can be combined in adjunct clauses. The semantics we propose explains the possible meanings of tenses in a variety of sentential contexts. It also supports an elegant constraint on tense combination in adjunct clauses. These semantic representations provide insights into the interpretations of tenses, and the constraints provide a source of syntactic disambiguation that has not previously been demonstrated. We demonstrate an implemented disambiguator for a certain class of three-clause sentences based on our theory. here answer these questions. . | A SIMPLIFIED THEORY OF TENSE REPRESENTATIONS AND CONSTRAINTS ON THEIR COMPOSITION Michael R. Brent MIT Artificial Intelligence Lab 545 Technology Square Cambridge MA 02139 michael@ ABSTRACT This paper proposes a set of representations for tenses and a set of constraints on how they can be combined in adjunct clauses. The semantics we propose explains the possible meanings of tenses in a variety of sentential contexts. It also supports an elegant constraint on tense combination in adjunct clauses. These semantic representations provide insights into the interpretations of tenses and the constraints provide a source of syntactic disambiguation that has not previously been demonstrated. We demonstrate an implemented disambiguator for a certain class of three-clause sentences based on our theory. 1 Introduction This paper proposes a set of representations for tenses and a set of constraints on how they can be combined. These representations provide insights into the interpretation of tenses and the constraints provide a source of syntactic disambiguation that has not previously been demonstrated. The sentences investigated in this paper contain multiple clauses connected by temporal causal connectives words like once by the time when and before. 1 shows that the tenses of multi-clause sentences affect their acceptability. This raises several important 1 a. when i once Jon before J arrives when once before Jon arrives questions. Which tense combinations are acceptable and which are not Why do they have the status they do How can observations like 1 be used to leverage problems like syntactic disambiguation and knowledge representation The representations and constraints proposed here answer these questions. Specifically they provide explanations in terms of the meanings of the tenses. We propose an explanatory theory and demonstrate an implementation which successfully disambiguates a class of three-clause sentences. The issues raised by 1 are significant for

• Báo cáo khoa học
• ASIMPLIFIED THEORY
• TENSE REPRESENTATIONS
• CONSTRAINTS ON THEIR COMPOSITION
• scientific reports
• model language
• process natural language
• Dialog Control
• Natural Language System
• Dialog Control in a Natural Language System
• Expanding the Horizons
• Natural Language Interfaces
• Phil Hayes
• PROSPECTS OR PRACTICAL
• NATURAL LANGUAGE SYSTEMS
• Workshops
• NATURAL LANGUAGE
• INTERACTION WITH MACHINES
• Long Papers
• COMPUTER INTEBFACE DESIGN MURRAY TUROFF DEPARTMENT OF COMPUTER
• IiVFORMATION SCIENCE IIEW JERSEY INSTITUTE OF TECHNOLOGY
• EVALUATION OF NATURAL LANGUAGE
• INTERFACES TO DATABASE SYSTEMS
• A PANEL DISCUSSION
• database query system
• J
• Norwood Crout
• INTERFACES TO DATA BASE SYSTEMS
• Bozena Henisz
• INTERPRETING NATURAL LANGUAGE
• DATABASE UPDATES
• S
• Jermld Kaplan Jim David
• TRANSPORTABLE NATURAL LANGUAGE
• INTERFACES TO DATABASES
• Gary G
• Hendrlx and William H
• Lewis
• DATABASES THEORETICAL
• TECHNICAL ISSUES
• TRANSPORTABLE NATURAL LANGUAGE INTERFACES
• PROBLEMS AND TECHNIQUES
• Barbara J
• Grosz
• THEORETICAL TECHNICAL ISSUES
• NATURAL LANGUAGE ACCESS TO DATABASES
• R
• Petrick
• Domain Independent
• Database Access Systems
• ISSUES IN NATURAL LANGUAGE
• ACCESS TO DATABASES
• A LOGIC PROGRAMMING PERSPECTIVE
• Sharon C
• Salveter David Maier
• PLANNING NATURAL LANGUAGE
• EXPRESSIONS REFERRING
• Douglas E
• Appelt
• THE TEXT SYSTEM
• NATURAL LANGUAGE GENERATION
• Kathleen R
• M
• MENTING A DATABASE
• KNOWLEDGE REPRESENTATION
• THE KEY TO THE SELECTION PROBLEM
• E
• Jeffrey Conklin David D
• McDonald
• A KNOWLEDGE ENGINEERING
• NATURAL LANGUAGE UNDERSTANDING
• Stuart C
• Shapiro
• NATURAL LANGUAGE TEXTS
• NECESSARILY GRAMMATICAL
• EVEN COMPLETE
• UNGRAMHATICALITY
• EXTRA GRAMMATICALITY
• NATURAL LANGUAGE UNDERSTANDING SYSTEMS
• Taxonomy
• Descriptions
• Individuals in Natural
• Language Understanding
• The Use of Ooject Special Knowledge
• Natural Language Processing
• Mark H
• Bursteln