Sciweavers

329 search results - page 7 / 66
» Stacking Dependency Parsers
Sort
View
WIA
1997
Springer
13 years 11 months ago
Construction of Efficient Generalized LR Parsers
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
Miguel A. Alonso, David Cabrero, Manuel Vilares Fe...
NAACL
2004
13 years 8 months ago
Speed and Accuracy in Shallow and Deep Stochastic Parsing
This paper reports some experiments that compare the accuracy and performance of two stochastic parsing systems. The currently popular Collins parser is a shallow parser whose out...
Ronald M. Kaplan, Stefan Riezler, Tracy H. King, J...
ACL
2008
13 years 9 months ago
Surprising Parser Actions and Reading Difficulty
An incremental dependency parser's probability model is entered as a predictor in a linear mixed-effects model of German readers' eye-fixation durations. This dependency...
Marisa Ferrara Boston, John T. Hale, Reinhold Klie...
LREC
2008
89views Education» more  LREC 2008»
13 years 9 months ago
Parser Evaluation and the BNC: Evaluating 4 constituency parsers with 3 metrics
We evaluate discriminative parse reranking and parser self-training on a new English test set using four versions of the Charniak parser and a variety of parser evaluation metrics...
Jennifer Foster, Josef van Genabith
ACL
2012
11 years 10 months ago
A Comparison of Chinese Parsers for Stanford Dependencies
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
Wanxiang Che, Valentin I. Spitkovsky, Ting Liu