TAILIEUCHUNG - Báo cáo khoa học: "Theoretical Evaluation of Estimation Methods for Data-Oriented Parsing"

We analyze estimation methods for DataOriented Parsing, as well as the theoretical criteria used to evaluate them. We show that all current estimation methods are inconsistent in the “weight-distribution test”, and argue that these results force us to rethink both the methods proposed and the criteria used. | Theoretical Evaluation of Estimation Methods for Data-Oriented Parsing Willem Zuidema Institute for Logic Language and Computation University of Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam the Netherlands. jzuidema@ Abstract We analyze estimation methods for Data-Oriented Parsing as well as the theoretical criteria used to evaluate them. We show that all current estimation methods are inconsistent in the weight-distribution test and argue that these results force us to rethink both the methods proposed and the criteria used. 1 Introduction Stochastic Tree Substitution Grammars henceforth STSGs are a simple generalization of Probabilistic Context Free Grammars where the productive elements are not rewrite rules but elementary trees of arbitrary size. The increased flexibility allows STSGs to model a variety of syntactic and statistical dependencies using relatively complex primitives but just a single and extremely simple global rule substitution. STSGs can be seen as Stochastic Tree Adjoining Grammars without the adjunction operation. STSGs are the underlying formalism of most instantiations of an approach to statistical parsing known as Data-Oriented Parsing Scha 1990 Bod 1998 . In this approach the subtrees of the trees in a tree bank are used as elementary trees of the grammar. In most DOP models the grammar used is an STSG with in principle all subtrees1 of the trees in the tree bank as elementary trees. For disambiguation the best parse tree is taken to be the most probable parse according to the weights of the grammar. Several methods have been proposed to decide on the weights based on observed tree frequencies 1A subtree t of a parse tree t is a tree such that every node i in t equals a node i in t and i either has no daughters or the same daughter nodes as i. in a tree bank. The first such method is now known as DOP1 Bod 1993 . In combination with some heuristic constraints on the allowed subtrees it has been remarkably successful on

• Báo cáo khoa học
• Theoretical Evaluation
• Estimation Methods
• Data Oriented Parsing
• scientific reports
• model language
• process natural language
• Vietnam Journal of Science and Technology
• Theoretical evaluation of the pKa values
• The pKa values
• Gaussian basis set
• Density functional theory
• Numerical basis sets
• Gaussian basis sets
• Lecture Principles of Entrepreneurship
• Principles of Entrepreneurship
• Bài giảng Nguyên tắc khởi nghiệp
• Evaluation of opportunities
• Theoretical framework
• Evaluation process
• Natural benzaldehyde synthesis
• HETP evaluation
• Batch distillation
• Random packing
• Packing structures
• Precision seeding
• Seeding performance
• Vacuum plate
• Cotton seed
• Maize seed
• Seed release frequency
• BMC Chemistry
• Chloronitrobenzoic acids
• Single crystal X ray difraction
• Chemical reactivity
• 2 chloro 5 nitrobenzoic acids
• 4 nitrobenzoic acid
• Financial markets
• Statistical analysis
• Foreign direct investments
• Main african stock exchanges markets
• BMC Musculoskeletal Disorders
• Posterior cruciate ligament
• Tunnel angle
• Computed tomography
• PCL reconstructed knees
• BMC Genomics
• Pinus sylvestris
• Genotyping by sequencing
• Predictive ability
• Predictive accuracy
• Theoretical accuracy
• 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