TAILIEUCHUNG - Báo cáo khoa học: "Crossed Serial Dependencies:i low-power parseable extension to GPSG"

An extension to the GPSG grammatical formalism is solution. proposed, finite allowing non-terminals to consist of sentences sequences of category labels, and allowing those schematic variables to range over such sequences. appropriate. | Crossed Serial Dependencies A low-power parseable extension to GPSG Henry Thompson Department of Artificial Intelligence and Program in Cognitive Science University of Edinburgh Hope Park Square Meadow Lane Edinburgh EH8 9NW SCOTLAND ABSTRACT An extension to the GPSG grammatical formalism is proposed allowing non-terminals to consist of finite sequences of category labels and allowing schematic variables to range over such sequences. The extension is shown to be sufficient to provide a strongly adequate grammar for crossed serial dependencies as found in . Dutch subordinate clauses. The structures induced for such constructions are argued to be more appropriate to data involving conjunction than some previous proposals have been. The extension is shown to be parseable by a simple extension to an existing parsing method for GPSG. I. INTRODUCTION There has been considerable interest in the community lately with the implications of crossed serial dependencies in . Dutch subordinate clauses for non-transformational theories of grammar. Although context-free phrase structure grammars under the standard interpretations are weakly adequate to generate such languages as anbn they are not capable of assigning the correct dependencies - that is they are not strongly adequate. In a recent paper Bresnan Kaplan Peters and Zaenen 1982 hereafter BKPZ a solution to the Dutch problem was presented in terms of LFG Kaplan and Bresnan 1982 which is known to have considerably more than context-free power steedman 1983 and Joshi 1983 have also made proposals for solutions in terms of steedman Ades grammars and tree adjunction grammars Ades and Steedman 1982 Joshi Levy and Yueh 1975 . In this paper I present a minimal extension to the GPSG formalism Gazdar 1981c which also provides a solution. It induces structures for the relevant sentences which are non-trivially distinct from those in BKPZ and which I argue are more appropriate. It appears when suitably constrained to be similar

• Báo cáo khoa học
• Crossed Serial Dependencies
• low power parseable extension to GPSG
• Henry Thompson
• 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