A System for Experiments with Dependency Parsers
In this paper we present a system for experimenting with combinations of dependency parsers. The system supports initial training of different parsing models, creation of parsebank(s) with these models, and different strategies for the construction of ensemble models aimed at improving the output of the individual models by voting. The system employs two algorithms for construction of dependency trees from several parses of the same sentence and several ways for ranking of the arcs in the resulting trees. We have performed experiments with state-of-the-art dependency parsers including MaltParser, MSTParser, TurboParser, and MATEParser, on the data from the Bulgarian treebank -- BulTreeBank. Our best result from these experiments is slightly better then the best result reported in the literature for this language.
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingSentenceSimilar Papers 제목 키워드 기반
A Dependency Perspective on RST Discourse Parsing and Evaluation
Computational text-level discourse analysis mostly happens within Rhetorical Structure Theory (RST), whose structures have classically been presented as constituency trees, and relies on data from the RST Discourse Treeb…
Constituency ParsingDependency ParsingDiscourse ParsingHybrid Oracle: Making Use of Ambiguity in Transition-based Chinese Dependency Parsing
In the training of transition-based dependency parsers, an oracle is used to predict a transition sequence for a sentence and its gold tree. However, the transition system may exhibit ambiguity, that is, there can be mul…
Chinese Dependency ParsingDependency ParsingSentenceComparing Neural Network Parsers for a Less-resourced and Morphologically-rich Language: Amharic Dependency Parser
In this paper, we compare four state-of-the-art neural network dependency parsers for the Semitic language Amharic. As Amharic is a morphologically-rich and less-resourced language, the out-of-vocabulary (OOV) problem wi…
POSPOS TaggingOld French Dependency Parsing: Results of Two Parsers Analysed from a Linguistic Point of View
The treatment of medieval texts is a particular challenge for parsers. I compare how two dependency parsers, one graph-based, the other transition-based, perform on Old French, facing some typical problems of medieval te…
Dependency ParsingViable Dependency Parsing as Sequence Labeling
We recast dependency parsing as a sequence labeling problem, exploring several encodings of dependency trees as labels. While dependency parsing by means of sequence labeling had been attempted in existing work, results …
Dependency Parsing