Abstract

We present a new dependency parsing algorithm based on the decomposition of large sentences into smaller units such as clauses and intraclausal coordinations. For the identification of these units, new methods combining machine learning techniques and heuristic rules were developed. The algorithm was evaluated on the Slovene dependency treebank text corpus. Compared to the MSTP parser, currently the most accurate for Slovene, parsing accuracy was improved by 1.27 percentage points, which equals 6.4

Keywords

Cite this article

@article{cai-1957-2012-2,
  author  = {Domen Marinčič and Tomaž Šef and Matjaž Gams},
  title   = {Parsing With Clause and Intraclausal Coordination Detection},
  journal = {Computing and Informatics},
  volume  = {31},
  number  = {2},
  pages   = {299--329},
  year    = {2012},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2012/2/parsing-with-clause-and-intraclausal-coordination-detection/}
}
Download .bib