Easy First Dependency Parsing of Modern Hebrew

Yoav Goldberg, Michael Elhadad

Research output: Contribution to conferencePaperpeer-review

18 Scopus citations

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 languageEnglish
Pages103-107
Number of pages5
StatePublished - 2010
Externally publishedYes
Event1st Workshop on Statistical Parsing of Morphologically-Rich Languages, SPMRL 2010 - Los Angeles, United States
Duration: 5 Jun 2010 → …

Conference

Conference1st Workshop on Statistical Parsing of Morphologically-Rich Languages, SPMRL 2010
Country/TerritoryUnited States
CityLos Angeles
Period5/06/10 → …

Bibliographical note

Funding Information:
Supported by the Lynn and William Frankel Center for Computer Sciences, Ben Gurion University

Publisher Copyright:
© 2010 Association for Computational Linguistics

Fingerprint

Dive into the research topics of 'Easy First Dependency Parsing of Modern Hebrew'. Together they form a unique fingerprint.

Cite this