Sciweavers

Share
EMNLP
2011
7 years 11 months ago
Multi-Source Transfer of Delexicalized Dependency Parsers
We present a simple method for transferring dependency parsers from source languages with labeled training data to target languages without labeled training data. We first demons...
Ryan T. McDonald, Slav Petrov, Keith Hall
ACL
2011
8 years 2 months ago
Neutralizing Linguistically Problematic Annotations in Unsupervised Dependency Parsing Evaluation
Dependency parsing is a central NLP task. In this paper we show that the common evaluation for unsupervised dependency parsing is highly sensitive to problematic annotations. We s...
Roy Schwartz, Omri Abend, Roi Reichart, Ari Rappop...
COLING
2010
8 years 6 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...
COLING
2010
8 years 6 months ago
Semi-supervised dependency parsing using generalized tri-training
Martins et al. (2008) presented what to the best of our knowledge still ranks as the best overall result on the CONLLX Shared Task datasets. The paper shows how triads of stacked ...
Anders Søgaard, Christian Rishøj
EMNLP
2010
8 years 8 months ago
Top-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
Eugene Charniak
EMNLP
2009
8 years 9 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
NAACL
2010
8 years 9 months ago
Reranking the Berkeley and Brown Parsers
The Brown and the Berkeley parsers are two state-of-the-art generative parsers. Since both parsers produce n-best lists, it is possible to apply reranking techniques to the output...
Mark Johnson, Ahmet Engin Ural
ACL
2010
8 years 9 months ago
Simple, Accurate Parsing with an All-Fragments Grammar
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
Mohit Bansal, Dan Klein
ACL
2010
8 years 9 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
TCS
2010
8 years 9 months ago
Error-repair parsing schemata
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...
Carlos Gómez-Rodríguez, Miguel A. Al...
books