Sciweavers

14 search results - page 2 / 3
» Transition-based Dependency Parsing with Rich Non-local Feat...
Sort
View
ACL
2011
12 years 9 months ago
Temporal Restricted Boltzmann Machines for Dependency Parsing
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
Nikhil Garg, James Henderson
ACL
2006
13 years 6 months ago
Discriminative Classifiers for Deterministic Dependency Parsing
Deterministic parsing guided by treebankinduced classifiers has emerged as a simple and efficient alternative to more complex models for data-driven parsing. We present a systemat...
Johan Hall, Joakim Nivre, Jens Nilsson
NAACL
2010
13 years 3 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
COLING
2008
13 years 6 months ago
Parsing the SynTagRus Treebank of Russian
We present the first results on parsing the SYNTAGRUS treebank of Russian with a data-driven dependency parser, achieving a labeled attachment score of over 82% and an unlabeled a...
Joakim Nivre, Igor Boguslavsky, Leonid L. Iomdin
ACL
2011
12 years 9 months ago
Event Extraction as Dependency Parsing
Nested event structures are a common occurrence in both open domain and domain specific extraction tasks, e.g., a “crime” event can cause a “investigation” event, which c...
David McClosky, Mihai Surdeanu, Christopher D. Man...