TAILIEUCHUNG - Báo cáo khoa học: "STRUCTURAL DISAMBIGUATION WITH CONSTRAINT PROPAGATION"

We present a new grammatical formalism called Constraint Dependency G r a m m a r (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsing is formalized as a constraint satisfaction problem over a finite domain so that efficient constraint-propagation algorithms can be employed to reduce structural ambiguity without generating individual parse trees. The weak generative capacity and the computational complexity of CDG parsing are also discussed. | STRUCTURAL DISAMBIGUATION WITH CONSTRAINT PROPAGATION Hừoshi Maruyama IBM Research Tokyo Research Laboratory 5-19 Sanbancho Chiyoda-ku Tokyo 102 Japan Abstract We present a new grammatical formalism called Constraint Dependency Grammar CDG in which every grammatical rule is given as a constraint on word-to-word modifications. CDG parsing is formalized as a constraint satisfaction problem over a finite domain so that efficient constraint-propagation algorithms can be employed to reduce structural ambiguity without generating individual parse trees. The weak generative capacity and the computational complexity of CDG parsing are also discussed. 1 INTRODUCTION We are interested in an efficient treatment of structural ambiguity in natural language analysis. It is known that every-way ambiguous constructs such as prepositional attachment in English have a Catalan number of ambiguous parses Church and Patil 1982 which grows at a faster than exponential rate Knuth 1975 . A parser should be provided with a disambiguation mechanism that does not involve generating such a combinatorial number of parse trees explicitly. We have developed a parsing method in which an intermediate parsing result is represented as a data structure called a constraint network. Every solution that satisfies all the constraints simultaneously corresponds to an individual parse tree. No explicit parse trees are generated until ultimately necessary. Parsing and successive disambiguation are performed by adding new constraints to the constraint network. Newly added constraints are efficiently propagated over the network by Constraint Propagation Waltz 1975 Montanari 1976 to remove inconsistent values. In this paper we present the basic ideas of a formal grammatical theory called Constraint Dependency Grammar CDG for short that makes this parsing technique possible. CDG has a reasonable time bound in its parsing while its weak generative capacity is strictly greater than that .

• Báo cáo khoa học
• STRUCTURAL DISAMBIGUATION
• CONSTRAINT PROPAGATION
• Hiroshi Maruyama
• scientific reports
• model language
• process natural language
• Structural Semantic Relatedness
• A Knowledge Based Method to Named Entity Disambiguation
• Xianpei Han Jun Zhao
• báo cáo khoa học
• báo cáo ngôn ngữ
• ngôn ngữ tự nhiên
• Reliable Estimation
• Strength of Association
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Structural Correspondence Learning
• Parse Disambiguation
• Barbara Plank
• An Endogeneous Corpus Based Method
• Structural Noun Phrase Disambiguation
• Didier Bourigault
• 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