Sciweavers

31 search results - page 3 / 7
» Tree Revision Learning for Dependency Parsing
Sort
View
NAACL
2010
14 years 7 months ago
Ensemble Models for Dependency Parsing: Cheap and Good?
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
Mihai Surdeanu, Christopher D. Manning
NAACL
2010
14 years 7 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
60
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 9 months ago
DepAnn - An Annotation Tool for Dependency Treebanks
DepAnn is an interactive annotation tool for dependency treebanks, providing both graphical and text-based annotation interfaces. The tool is aimed for semi-automatic creation of t...
Tuomo Kakkonen
ACL
2012
12 years 12 months ago
Selective Sharing for Multilingual Dependency Parsing
We present a novel algorithm for multilingual dependency parsing that uses annotations from a diverse set of source languages to parse a new unannotated language. Our motivation i...
Tahira Naseem, Regina Barzilay, Amir Globerson
ACL
2006
14 years 11 months ago
Trimming CFG Parse Trees for Sentence Compression Using Machine Learning Approaches
Sentence compression is a task of creating a short grammatical sentence by removing extraneous words or phrases from an original sentence while preserving its meaning. Existing me...
Yuya Unno, Takashi Ninomiya, Yusuke Miyao, Jun-ich...