Sciweavers

32 search results - page 2 / 7
» Comparing the Accuracy of CCG and Penn Treebank Parsers
Sort
View
ACL
2006
13 years 10 months ago
Trace Prediction and Recovery with Unlexicalized PCFGs and Slash Features
This paper describes a parser which generates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guara...
Helmut Schmid
ACL
2007
13 years 10 months ago
Formalism-Independent Parser Evaluation with CCG and DepBank
A key question facing the parsing community is how to compare parsers which use different grammar formalisms and produce different output. Evaluating a parser on the same resource...
Stephen Clark, James R. Curran
AAAI
2007
13 years 11 months ago
Ungreedy Methods for Chinese Deterministic Dependency Parsing
Deterministic dependency parsing has often been regarded as an efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more comp...
Xiangyu Duan, Jun Zhao, Bo Xu
EMNLP
2009
13 years 7 months ago
Improving Dependency Parsing with Subtrees from Auto-Parsed Data
This paper presents a simple and effective approach to improve dependency parsing by using subtrees from auto-parsed data. First, we use a baseline parser to parse large-scale una...
Wenliang Chen, Jun'ichi Kazama, Kiyotaka Uchimoto,...
IJCNLP
2005
Springer
14 years 2 months ago
Parsing Biomedical Literature
We present a preliminary study of several parser adaptation es evaluated on the GENIA corpus of MEDLINE abstracts [1,2]. We begin by observing that the Penn Treebank (PTB) is lexic...
Matthew Lease, Eugene Charniak