2006
DOI: 10.1007/11846406_12
|View full text |Cite
|
Sign up to set email alerts
|

Combining Czech Dependency Parsers

Abstract: In this paper we describe in detail two dependency parsing techniques developed and evaluated using the Prague Dependency Treebank 2.0. Then we propose two approaches for combining various existing parsers in order to obtain better accuracy. The highest parsing accuracy reported in this paper is 85.84 %, which represents 1.86 % improvement compared to the best single state-of-the-art parser. To our knowledge, no better result achieved on the same data has been published yet.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…As already mentioned, the first experiments integrating a segment and/or a clause identification have brought promising results in dependency syntactic parsing (namely a combination of several parsers, one of them exploiting the idea of segmentation, see Holan and Ž abokrtský 2006) and in machine translation between related languages (namely Homola and Kuboň 2010). These results encourage us in our effort to prepare a sufficient amount of reliable data analyzed at the level of a sentence structure.…”
Section: Prague Dependency Treebank and Segment Annotationmentioning
confidence: 96%
See 1 more Smart Citation
“…As already mentioned, the first experiments integrating a segment and/or a clause identification have brought promising results in dependency syntactic parsing (namely a combination of several parsers, one of them exploiting the idea of segmentation, see Holan and Ž abokrtský 2006) and in machine translation between related languages (namely Homola and Kuboň 2010). These results encourage us in our effort to prepare a sufficient amount of reliable data analyzed at the level of a sentence structure.…”
Section: Prague Dependency Treebank and Segment Annotationmentioning
confidence: 96%
“…Jones (1994) for English or Ohno et al (2006) for Japanese; also first results for Czech are promising (esp. a clause segmentation in a rule-based dependency parser, see Holan and Ž abokrtský 2006, or in a machine translation system for related languages, as in Homola and Kuboň 2010).…”
Section: Motivationmentioning
confidence: 97%
“…UAS (unlabeled LAS (labeled attachment score) attachment score) Our best system (joint prediction, BERT, Flair) 93.10% 89. 93% Holan andŽabokrtský (2006) [16] 85.84% -Novák andŽabokrtský (2007) [26] 84.69% - Koo et al (2010) [21] † 87.32% -Treex framework (using MST parser&manual rules) [39] ‡ 83.93% 77.04% PDT 2.0 subset in CoNLL 2007 shared task; manually annotated POS tags available. Nakagawa (2007) [23] 86.28% 80.19% PDT 2.0 subset in CoNLL 2009 shared task; manually annotated POS tags available.…”
Section: Systemmentioning
confidence: 99%
“…Otherwise, Spoustová et al (2009) [31] used an averaged perceptron for POS tagging. For parsing the PDT, Holan and Zabokrtský (2006) [16] and Novák and Žabokrtský (2007) [26] used a combination of non-neural parsing techniques .…”
Section: Related Workmentioning
confidence: 99%