Sciweavers

77 search results - page 1 / 16
» Evaluation of Dependency Parsers on Unbounded Dependencies
Sort
View
COLING
2010
12 years 12 months ago
Evaluation of Dependency Parsers on Unbounded Dependencies
We evaluate two dependency parsers, MSTParser and MaltParser, with respect to their capacity to recover unbounded dependencies in English, a type of evaluation that has been appli...
Joakim Nivre, Laura Rimell, Ryan T. McDonald, Carl...
EMNLP
2009
13 years 2 months ago
Unbounded Dependency Recovery for Parser Evaluation
This paper introduces a new parser evaluation corpus containing around 700 sentences annotated with unbounded dependencies, from seven different grammatical constructions. We run ...
Laura Rimell, Stephen Clark, Mark Steedman
ANLP
1997
111views more  ANLP 1997»
13 years 6 months ago
A non-projective dependency parser
We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe ...
Pasi Tapanainen, Timo Järvinen
ACL
2003
13 years 6 months ago
Parsing with Generative Models of Predicate-Argument Structure
The model used by the CCG parser of Hockenmaier and Steedman (2002b) would fail to capture the correct bilexical dependencies in a language with freer word order, such as Dutch. T...
Julia Hockenmaier
ACL
2009
13 years 2 months ago
Improving data-driven dependency parsing using large-scale LFG grammars
This paper presents experiments which combine a grammar-driven and a datadriven parser. We show how the conversion of LFG output to dependency representation allows for a techniqu...
Lilja Øvrelid, Jonas Kuhn, Kathrin Spreyer