• Corpus ID: 7442684

Transition-Based Dependency Parsing With Pluggable Classifiers

  title={Transition-Based Dependency Parsing With Pluggable Classifiers},
  author={Alex Rudnick},
In principle, the design of transition-based dependency parsers makes it possible to experiment with any general-purpose classifier without other changes to the parsing algorithm. In practice, however, it often takes substantial software engineering to bridge between the different representations used by two software packages. Here we present extensions to MaltParser that allow the drop-in use of any classifier conforming to the interface of the Weka machine learning package, a wrapper for the… 

Figures from this paper


Memory-Based Dependency Parsing
Evaluation shows that memory-based learning gives a significant improvement over a previous probabilistic model based on maximum conditional likelihood estimation and that the inclusion of lexical features improves the accuracy even further.
CoNLL-X Shared Task on Multilingual Dependency Parsing
How treebanks for 13 languages were converted into the same dependency format and how parsing performance was measured is described and general conclusions about multi-lingual parsing are drawn.
Algorithms for Deterministic Incremental Dependency Parsing
This article presents a general framework for describing and analyzing algorithms for deterministic incremental dependency parsing, formalized as transition systems and shows that all four algorithms give competitive accuracy, although the non-projective list-based algorithm generally outperforms the projective algorithms for languages with a non-negligible proportion of non- projective constructions.
The CoNLL 2007 Shared Task on Dependency Parsing
The tasks of the different tracks are defined and how the data sets were created from existing treebanks for ten languages are described, to characterize the different approaches of the participating systems and report the test results and provide a first analysis of these results.
Labeled Pseudo-Projective Dependency Parsing with Support Vector Machines
This work uses SVM classifiers to predict the next action of a deterministic parser that builds labeled projective dependency graphs in an incremental fashion and presents evaluation results and an error analysis focusing on Swedish and Turkish.
Non-Projective Dependency Parsing using Spanning Tree Algorithms
Using this representation, the parsing algorithm of Eisner (1996) is sufficient for searching over all projective trees in O(n3) time and is extended naturally to non-projective parsing using Chu-Liu-Edmonds (Chu and Liu, 1965; Edmonds, 1967) MST algorithm, yielding an O( n2) parsing algorithm.
A Fundamental Algorithm for Dependency Parsing
This paper presents a fundamental algorithm for parsing natural language sentences into dependency trees that operates one word at a time, attaching each word as soon as it can be attached, corresponding to properties claimed for the parser in the human brain.
C4.5: Programs for Machine Learning
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Scaling to Very Very Large Corpora for Natural Language Disambiguation
This paper examines methods for effectively exploiting very large corpora when labeled data comes at a cost, and evaluates the performance of different learning methods on a prototypical natural language disambiguation task, confusion set disambigsuation.
MaltParser: A Data-Driven Parser-Generator for Dependency Parsing
MaltParser is introduced, a data-driven parser generator for dependency parsing given a treebank in dependency format and can be used to induce a parser for the language of the treebank.