TAILIEUCHUNG - Báo cáo khoa học: "A Lazy Way to Chart-Parse with Categorial Grammars"

There has recendy been a revival of interest in Categorial Grammars (CG) among computational linguists. The various versions noted below which extend pure C G by including operations such as functional composition have been claimed to offer simple and uniform accounts of a wide range of natural language (NL) constructions involving bounded and unbounded "movement" and coordination "reduction" in a number of languages. Such grammars have obvious advantages for computational applications, provided that they can be parsed efficiently. However, many of the proposed extensions engender proliferatingsemantically equivalent surface syntactic "spurious analyses" have been claimed to compromise theirefficient. | A Lazy Way to Chart-Parse with Categorial Grammars Remo Pareschi and Mark Steedman Dept of Al and Centre for Cognitive Science Univ of Edinburgh t and Dept of Computer and Information Science Univ of Pennsylvania ABSTRACT There has recently been a revival of interest in Categorial Grammars CG among computational linguists. The various versions noted below which extend pure CG by including operations such as functional composition have been claimed to offer simple and uniform accounts of a wide range of natural language NL constructions involving bounded and unbounded movement and coordination reduction in a number of languages. Such grammars have obvious advantages for computational applications provided that they can be parsed efficiently. However many of the proposed extensions engender proliferating semantically equivalent surface syntactic analyses. These spurious analyses have been claimed to compromise theữ efficient parseability. The present paper describes a simple parsing algorithm for our own combinatory extension of CG. This algorithm offers a uniform treatment for spurious syntactic ambiguities and the genuine structural ambiguities which any processor must cope with by exploiting the associativity of functional composition and the procedural neutrality of the combinatory rules of grammar in a bottom-up left-to-right parser which delivers all semantically distinct analyses via a novel unification-based extension of chart-parsing. 1. Combinatory Categorial Grammars Pure categorial grammar CG is a grammatical notation equivalent in power to context-free grammars which puts all syntactic information in the lexicon via the specification of all grammatical entities as either functions or arguments. For example such a grammar might capture the obvious intuitions concerning constituency in a sentence like John must leave by identifying the VP leave and the NP John as the arguments of the tensed verb must and the verb itself as a function combining to its right

• Báo cáo khoa học
• A Lazy Way to Chart Parse
• Categorial Grammars
• Remo Pareschi
• 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