tailieunhanh - Báo cáo khoa học: "Efficient Parsing with Linear Context-Free Rewriting Systems"

Previous work on treebank parsing with discontinuous constituents using Linear Context-Free Rewriting systems (LCFRS) has been limited to sentences of up to 30 words, for reasons of computational complexity. There have been some results on binarizing an LCFRS in a manner that minimizes parsing complexity, but the present work shows that parsing long sentences with such an optimally binarized grammar remains infeasible. Instead, we introduce a technique which removes this length restriction, while maintaining a respectable accuracy. The resulting parser has been applied to a discontinuous treebank with favorable results. . | Efficient Parsing with Linear Context-Free Rewriting Systems Andreas van Cranenburgh Huygens ING ILLC University of Amsterdam Royal Netherlands Academy of Arts and Sciences Postbus 90754 2509 LT The Hague the Netherlands Abstract Previous work on treebank parsing with discontinuous constituents using Linear Context-Free Rewriting systems LCFRS has been limited to sentences of up to 30 words for reasons of computational complexity. There have been some results on binarizing an LCFRS in a manner that minimizes parsing complexity but the present work shows that parsing long sentences with such an optimally binarized grammar remains infeasible. Instead we introduce a technique which removes this length restriction while maintaining a respectable accuracy. The resulting parser has been applied to a discontinuous treebank with favorable results. 1 Introduction Discontinuity in constituent structures cf. figure 1 2 is important for a variety of reasons. For one it allows a tight correspondence between syntax and semantics by letting constituent structure express argument structure Skut et al. 1997 . Other reasons are phenomena such as extraposition and word-order freedom which arguably require discontinuous annotations to be treated systematically in phrase-structures McCawley 1982 Levy 2005 . Empirical investigations demonstrate that discontinuity is present in non-negligible amounts around 30 of sentences contain discontinuity in two German treebanks Maier and S0gaard 2008 Maier and Lichte 2009 . Recent work on treebank parsing with discontinuous constituents Kallmeyer and Maier 2010 Maier 2010 Evang and Kallmeyer 2011 van Cranen-burgh et al. 2011 shows that it is feasible to directly parse discontinuous constituency annotations as given in the German Negra Skut et al. SBARQ I I SQ VP WHNP MD NP VB i l I What should I do Figure 1 A tree with WH-movement from the Penn treebank in which traces have been converted to discontinuity. .

• Báo cáo khoa học
• Efficient Parsing
• Linear Context Free Rewriting Systems
• Andreas van
• scientific reports
• model language
• process natural language
• Efficient CCG Parsing
• A versus Adaptive Supertagging
• Long Papers
• báo cáo khoa học
• báo cáo ngôn ngữ
• ngôn ngữ tự nhiên
• Unary Constraints
• Efficient Context Free Parsing
• Nathan Bodenstab
• Beam Width Prediction
• Efficient
• Feature based
• Conditional Random Field Parsing
• xử lý ngôn ngữ tự nhiên
• An intelligent search engine
• GUI based efficient MEDLINE search tool
• syntactic parsing
• mô hình ngôn ngữ
• Learning Efficient Parsing
• Gertjan van Noord
• 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