Difference between revisions of "Koo and Collins ACL 2010"
From Cohen Courses
Jump to navigationJump to search| Line 9: | Line 9: | ||
== Summary == | == Summary == | ||
| − | This [[Category::paper]] presents a higher-order [[AddressesProblem::Dependency Parsing|dependency parser]] that can evaluate substructures containing three dependencies, using both sibling-style and grandchild-style interactions. The algorithms require only <math>O(n^4)</math> time and were evaluated on the [[UsesDataset::Penn Treebank]] and the [[UsesDataset::Prague Dependency Treebank]]. | + | This [[Category::paper]] presents a higher-order [[AddressesProblem::Dependency Parsing|dependency parser]] that can evaluate substructures containing three dependencies, using both sibling-style and grandchild-style interactions. The algorithms presented require only <math>O(n^4)</math> time and were evaluated on the [[UsesDataset::Penn Treebank]] and the [[UsesDataset::Prague Dependency Treebank]]. The implementation code was publicly released [http://groups.csail.mit.edu/nlp/dpo3/]. |
== Experimental results == | == Experimental results == | ||
Revision as of 22:06, 25 November 2011
Citation
Koo, T. and Collins, M. 2010. Efficient Third-Order Dependency Parsers. In Proceedings of ACL, pp. 1-11. Association for Computational Linguistics.
Online version
Summary
This paper presents a higher-order dependency parser that can evaluate substructures containing three dependencies, using both sibling-style and grandchild-style interactions. The algorithms presented require only time and were evaluated on the Penn Treebank and the Prague Dependency Treebank. The implementation code was publicly released [1].
Experimental results
Bla bla.
Related papers
Bla bla.
