Abstract
We investigate the performance of an easy-first, non-directional dependency parser on the Hebrew Dependency treebank. We show that with a basic feature set the greedy parser's accuracy is on a par with that of a first-order globally optimized MST parser. The addition of morphological-agreement feature improves the parsing accuracy, making it on-par with a second-order globally optimized MST parser. The improvement due to the morphological agreement information is persistent both when gold-standard and automatically-induced morphological information is used.
| Original language | English |
|---|---|
| Pages | 103-107 |
| Number of pages | 5 |
| State | Published - 2010 |
| Externally published | Yes |
| Event | 1st Workshop on Statistical Parsing of Morphologically-Rich Languages, SPMRL 2010 - Los Angeles, United States Duration: 5 Jun 2010 → … |
Conference
| Conference | 1st Workshop on Statistical Parsing of Morphologically-Rich Languages, SPMRL 2010 |
|---|---|
| Country/Territory | United States |
| City | Los Angeles |
| Period | 5/06/10 → … |
Bibliographical note
Publisher Copyright:© 2010 Association for Computational Linguistics
Funding
Supported by the Lynn and William Frankel Center for Computer Sciences, Ben Gurion University
| Funders | Funder number |
|---|---|
| Ben Gurion University | |
| Lynn and William Frankel Center for Computer Sciences |