TAILIEUCHUNG - Báo cáo khoa học: "The Best of Both Worlds – A Graph-based Completion Model for Transition-based Parsers"

Transition-based dependency parsers are often forced to make attachment decisions at a point when only partial information about the relevant graph configuration is available. In this paper, we describe a model that takes into account complete structures as they become available to rescore the elements of a beam, combining the advantages of transition-based and graph-based approaches. We also propose an efficient implementation that allows for the use of sophisticated features and show that the completion model leads to a substantial increase in accuracy. We apply the new transition-based parser on typologically different languages such as English, Chinese, Czech, and. | The Best of Both Worlds - A Graph-based Completion Model for Transition-based Parsers Bernd Bohnet and Jonas Kuhn University of Stuttgart Institute for Natural Language Processing bohnet jonas @ Abstract Transition-based dependency parsers are often forced to make attachment decisions at a point when only partial information about the relevant graph configuration is available. In this paper we describe a model that takes into account complete structures as they become available to rescore the elements of a beam combining the advantages of transition-based and graph-based approaches. We also propose an efficient implementation that allows for the use of sophisticated features and show that the completion model leads to a substantial increase in accuracy. We apply the new transition-based parser on typologically different languages such as English Chinese Czech and German and report competitive labeled and unlabeled attachment scores. 1 Introduction Background. A considerable amount of recent research has gone into data-driven dependency parsing and interestingly throughout the continuous process of improvements two classes of parsing algorithms have stayed at the centre of attention the transition-based Nivre 2003 vs. the graph-based approach Eisner 1996 McDonald et al. 2005 .1 The two approaches apply fundamentally different strategies to solve the task of finding the optimal labeled dependency tree over the words of an input sentence where supervised machine learning is used to estimate the scoring parameters on a treebank . The transition-based approach is based on the conceptually and cognitively compelling idea 1More references will be provided in sec. 2. that machine learning . a model of linguistic experience is used in exactly those situations when there is an attachment choice in an otherwise deterministic incremental left-to-right parsing process. As a new word is processed the parser has to decide on one out of a small number of .

• Báo cáo khoa học
• The Best of Both Worlds
• A Graph based Completion Model
• Transition based Parsers
• scientific reports
• model language
• process natural language
• phân tích kỹ thuật
• kỹ thuật chứng khoán
• kỹ thuật đầu tư
• hướng dẫn chứng khoán
• tài liệu chứng khoán
• công nghệ thông tin
• White Papers
• Best of Both Worlds
• Linux
• hệ điều hành
• 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