Abstract
We use the grammatical relations (GRs) described in Carroll et al. (1998) to compare a number of parsing algorithms A first ranking of the parsers is provided by comparing the extracted GRs to a gold standard GR annotation of 500 Susanne sentences: this required an implementation of GR extraction software for Penn Treebank style parsers. In addition, we perform an experiment using the extracted GRs as input to the Lappin and Leass (1994) anaphora resolution algorithm. This produces a second ranking of the parsers, and we investigate the number of errors that are caused by the incorrect GRs.
Cite
CITATION STYLE
Preiss, J. (2003). Using grammatical relations to compare parsers. In 10th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2003 (pp. 291–298). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1067807.1067846
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
