TAILIEUCHUNG - Báo cáo khoa học: "Topological Parsing"

We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these grammars contain two primitive notions of constituency that are used to preserve the semantic or interpretational aspects of phrase structure, while at the same time providing a more efficient backbone for parsing based on word-order and contiguity constraints. A simple parsing algorithm is presented, and compilation of grammars into Constraint Handling Rules is also discussed. . | Topological Parsing Gerald Penn Department of Computer Science University of Toronto gpenn@ Mohammad Haji-Abdolhosseini Department of Linguistics University of Toronto mhaji@ Abstract We present a new grammar formalism for parsing with freer word-order languages motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs these grammars contain two primitive notions of constituency that are used to preserve the semantic or interpretational aspects of phrase structure while at the same time providing a more efficient backbone for parsing based on word-order and contiguity constraints. A simple parsing algorithm is presented and compilation of grammars into Constraint Handling Rules is also discussed. 1 Motivation There is a growing awareness among computational linguists that in order for the functionality of current real-world natural language applications to progress to the next level access to thematic roles and grammatical function assignment . who did what to whom will be just as important as a probabilistic model s ability to predict the next word in a string. In striving to represent useful meaning relations we and the annotated corpora we use have dutifully followed the common assumption in linguistics that the assignment of relations are artifacts of configurational ones primitive relationships between nodes in phrasestructure trees licensed by a grammar. In the case of parsing with English there have been some remarkable successes in the last five years most notably that of Collins 1999 and several successive improvements who use knowledge about headedness and subcategorisation traditional n-grams and some information about unbounded dependencies to dramatically improve on our ability to predict the most likely phrasestructure tree given a string of words with the tacit assumption that this tree has something to do with interpretation. While there have also been more modest successes with purely

• Báo cáo khoa học
• Topological Parsing
• Gerald Penn
• Long Papers
• scientific reports
• model language
• process natural language
• Topological Field Parsing of German
• Jackie Chi Kit Cheung
• báo cáo khoa học
• báo cáo ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• 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