An algorithm for pronominal anaphora resolution
Computational Linguistics
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
A maximum-entropy-inspired parser
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Assigning function tags to parsed text
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Does Baum-Welch re-estimation help taggers?
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
Three generative, lexicalised models for statistical parsing
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Single-classifier memory-based phrase chunking
ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
A low-complexity, broad-coverage probabilistic dependency parser for English
NAACLstudent '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: Proceedings of the HLT-NAACL 2003 student research workshop - Volume 3
Combining deep and shallow approaches in parsing German
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Artificial Intelligence in Medicine
Wide-coverage deep statistical parsing using automatic dependency structure annotation
Computational Linguistics
Toward a cross-framework parser annotation standard
CrossParser '08 Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation
A measure of syntactic flexibility for automatically identifying multiword expressions in corpora
MWE '07 Proceedings of the Workshop on a Broader Perspective on Multiword Expressions
A robust and hybrid deep-linguistic theory applied to large-scale parsing
ROMAND '04 Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data
Evaluating GETARUNS parser with GREVAL test suite
ROMAND '04 Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data
Text understanding with GETARUNS for Q/A and summarization
TextMean '04 Proceedings of the 2nd Workshop on Text Meaning and Interpretation
| Hi-index | 0.00 |
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.