9 search results - page 1 / 2 » Fast and Accurate Arc Filtering for Dependency Parsing |
COLING
2010
13 years 2 months ago
2010
ACL
2011
12 years 11 months ago
2011
Graph-based dependency parsing can be sped up significantly if implausible arcs are eliminated from the search-space before parsing begins. State-of-the-art methods for arc filt...
NAACL
2010
13 years 5 months ago
2010
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...
NAACL
2010
13 years 5 months ago
2010
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 ...
LREC
2010
13 years 8 months ago
2010
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...