TAILIEUCHUNG - Báo cáo khoa học: "LICENSING AND TREE ADJOINING GRAMMAR IN GOVERNMENT BINDING PARSING"

This paper presents an implemented, psychologically plausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licensing relations of [Abney, 1986] allows for the direct encoding of certain principles of grammar (. Theta Criterion, Case Filter) which drive structure building; (2) the working space of the parser is constrained to the domain determined by a Tree Adjoining Grammar elementary tree. All dependencies and constraints are locaiized within this bounded structure. . | LICENSING AND TREE ADJOINING GRAMMAR IN GOVERNMENT BINDING PARSING Robert Frank Department of Computer and Information Sciences University of Pennsylvania Philadelphia PA 19104 email frank@ Abstract This paper presents an implemented psychologically plausible parsing model for Government Binding theory grammars. Ỉ make use of two main ideas 1 a generalization of the licensing relations of Abney 1986 allows for the direct encoding of certain principles of grammar . Theta Criterion Case Filter which drive structure building 2 the working space of the parser is constrained to the domain determined by a Tree Adjoining Grammar elementary tree. All dependencies and constraints are localized within this bounded structure. The resultant parser operates in linear time and allows for incremental semantic interpretation and determination of grammaticality. 1 Introduction This paper aims to provide a psychologically plausible mechanism for putting the knowledge which a speaker has of the syntax of a language the competence grammar to use. The representation of knowledge of language I assume is that specified by Government Binding GB Theory introduced in Chomsky 1981 . GB as a competence theory emphatically does not specify the nature of the language processing mechanism. In fact proofs that transformational grammar is inadequate as a linguistic theory due to various performance measures are fundamentally flawed since they suppose a particular connection between the grammar and parser Berwick and Weinberg 1984 Nonetheless it seems desirable to maintain a fairly direct connection between the linguistic competence and 1 would like to thank the following for their valuable discussion and suggestions Naoki Fukui Jamie Henderson Aravind Joshi Tony Kroch Mitch Marcus Michael Niv Yves Schabes Mark Steedman Enric Vall-duvi. This work was partially supported by ARO Grants DAALO3-89-C0031 PR1 and DAAG29-84-K-0061 and DARPA gram N00014-85-K-0018. The author is .

• Báo cáo khoa học
• LICENSING AND TREE ADJOINING GRAMMAR
• GOVERNMENT BINDING PARSING
• Long Papers
• 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
• 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