TAILIEUCHUNG - Báo cáo khoa học: "Well-Nested Parallelism Constraints for Ellipsis Resolution"

The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ellipsis, and anaphora. Efficient algorithms exist for the sublanguage that models scope. But so far no terminating algorithm exists for sublanguages that model ellipsis. We introduce well-nested parallelism constraints and show that they solve this problem. | Well-Nested Parallelism Constraints for Ellipsis Resolution Katrin Erk and Joachim Niehren Saarland University Saarbriicken Germany erk@ niehren@ Abstract The Constraint Language for Lambda Structures CLLS is an expressive tree description language. It provides a uniform framework for underspecified semantics covering scope ellipsis and anaphora. Efficient algorithms exist for the sublanguage that models scope. But so far no terminating algorithm exists for sublanguages that model ellipsis. We introduce well-nested parallelism constraints and show that they solve this problem. 1 Introduction Ellipsis phenomena are ubiquitous in natural language . in VP ellipsis answers to questions and corrections. They have been studied extensively Sag 1976 Williams 1977 Fiengo and May 1994 Dalrymple et al. 1991 Hardt 1993 Kehler 1995 Lappin and Shih 1996 but remain difficult to handle. Among the problems to solve in connection with ellipsis are determining the ellipsis antecedent constructing a description of the ellipsis meaning and resolving the ellipsis . actually determining its meaning . In this paper we focus on the problem of resolving ellipsis. We assume an analysis of its structure source target and parallel elements in the Constraint Language for Lambda Structures CLLS Egg et al. 2001 . CLLS is an expressive tree description language that provides a uniform framework for semantic underspecification covering scope ellipsis and anaphora. CLLS offers dominance constraints for modeling scope ambiguity in a similar way as previous approaches Reyle 1993 Pinkal 1995 Bos 1996 parallelism constraints for modeling ellipsis and anaphoric links for modeling coreference. The interaction of ellipsis with scope quantifier parallelism is handled in a modular fashion. Enumerating scope readings becomes solving dominance constraints while ellipsis resolution is reduced to solving parallelism constraints. Constraint solving subsumes satisfiability checking.

• Báo cáo khoa học
• Well Nested Parallelism Constraints
• Ellipsis Resolution
• Katrin Erk and Joachim Niehren
• 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