Extracting and using trace-free functional dependencies from the penn treebank to reduce parsing complexity
暂无分享,去创建一个
[1] Andrei Mikheev,et al. Automatic Rule Induction for Unknown-Word Guessing , 1997, CL.
[2] Michael Collins,et al. Head-Driven Statistical Models for Natural Language Parsing , 2003, CL.
[3] Timo Järvinen,et al. A non-projective dependency parser , 1997, ANLP.
[4] Lucien Tesnière. Éléments de syntaxe structurale , 1959 .
[5] Mark Johnson,et al. A Simple Pattern-matching Algorithm for Recovering Empty Nodes and their Antecedents , 2002, ACL.
[6] Jason Eisner,et al. Bilexical Grammars and their Cubic-Time Parsing Algorithms , 2000 .
[7] Judita Preiss. Using Grammatical Relations to Compare Parsers , 2003, EACL.
[8] Ted Briscoe,et al. Corpus Annotation for Parser Evaluation , 1999, ArXiv.
[9] James Henderson,et al. Inducing History Representations for Broad Coverage Statistical Parsing , 2003, NAACL.
[10] Joakim Nivre,et al. An Efficient Algorithm for Projective Dependency Parsing , 2003, IWPT.
[11] John A. Carroll,et al. Robust, applied morphological generation , 2000, INLG.
[12] Dekang Lin,et al. A dependency-based method for evaluating broad-coverage parsers , 1995, Natural Language Engineering.
[13] Eugene Charniak,et al. A Maximum-Entropy-Inspired Parser , 2000, ANLP.
[14] Peter Neuhaus,et al. The Complexity of Recognition of Linguistically Adequate Dependency Grammars , 1997, ACL.
[15] Michael Collins,et al. A New Statistical Parser Based on Bigram Lexical Dependencies , 1996, ACL.
[16] S. Buchholz,et al. Memory-Based Grammatical Relation Finding , 2002 .
[17] Beatrice Santorini,et al. Building a Large Annotated Corpus of English: The Penn Treebank , 1993, CL.
[18] Dekang Lin,et al. Dependency-Based Evaluation of Minipar , 2003 .
[19] Gerold Schneider. A low-complexity, broad-coverage probabilistic Dependency Parser for English , 2003, HLT-NAACL.