Parsing With Clause and Intra-clausal Coordination Detection
Domen Marinčič; Jozef Stefan Institute ; Tomaž Šef; Jozef Stefan Institute ; Matjaž Gams; Jozef Stefan Institute
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
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 % relative error reduction.
Publié le : 2012-07-18
Classification:  Clause identification; intra-clausal coordination detection; dependency parsing; artificial intelligence 
@article{cai942,
     author = {Domen Marin\v ci\v c; Jozef Stefan Institute and Toma\v z \v Sef; Jozef Stefan Institute and Matja\v z Gams; Jozef Stefan Institute},
     title = {Parsing With Clause and Intra-clausal Coordination Detection},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai942}
}

Domen Marinčič; Jozef Stefan Institute; Tomaž Šef; Jozef Stefan Institute; Matjaž Gams; Jozef Stefan Institute. Parsing With Clause and Intra-clausal Coordination Detection. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai942/