TAILIEUCHUNG - Báo cáo khoa học: "New Approaches to Parsing Conjunctions Using Prolog"

Conjunctions are particularly difficult to parse in traditional, gramniars. This paper shows how a different representation, not on tree structures, markedly improves the parsing problem for conjunctions. It modifies the union of marker model proposed by GoodalI [19811, where conjllnction is considered as tile linearization of a three-dimensional union of a non-tree I),'med phrase marker representation. | New Approaches to Parsing Conjunctions Using Prolog Sandiway Fong Robert c. Berwick Artificial Intelligence Laboratory . 545 Technology Square Cambridge MA 02139 . Abstract Conjunctions are particularly difficult to parse in traditional phrase-based grammars. This paper shows how a different representation not based on tree structures markedly improves the parsing problem for conjunctions. It modifies the union of phrase marker model proposed by Goodall 1981 where conjunction is considered as the linearization of a three-dimensional union of a non-tree based phrase marker representation. A PROLOG grammar for conjunctions using this new approach is given. It is far simpler and more transparent than a recent phrase-based extraposition parser conjunctions by Dahl and McCord l934 . Unlike the Dahl and McCord or ATN SYSCONJ approach no special trail machinery is needed for conjunction beyond that required for analyzing simple sentences. While of comparable efficiency the new approach unifies under a single analysis a host of related constructions respectively sentences right node raising or gapping. Another advantage is that it is also completely reversible without cuts and therefore can be used to generate sentences. Introduction The problem addressed in this paper is to construct a grmnmatical device for handling coordination in natural language that is well founded in linguistic theory and yet computationally attractive. The linguistic theory should be powerful enough to describe all of the phenomenon in coordination but also constrained enough to reject all ungrammatical examples without undue complications. It is difficult to achieve such a line balance - especially since the term grammatical itself is highly subjective. Some examples of the kinds of phenomenon that must be handled are shown in fig. I The theory should also be amenable to computer implementation. For example the representation of the phrase marker should be conducive to both dean process

• Báo cáo khoa học
• New Approaches to Parsing
• Conjunctions Using Prolog
• Fong Robert C
• Berwick
• 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