Sciweavers

3 search results - page 1 / 1
» Reranking the Berkeley and Brown Parsers
Sort
View
NAACL
2010
13 years 2 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
2006
13 years 6 months ago
Reranking and Self-Training for Parser Adaptation
Statistical parsers trained and tested on the Penn Wall Street Journal (WSJ) treebank have shown vast improvements over the last 10 years. Much of this improvement, however, is ba...
David McClosky, Eugene Charniak, Mark Johnson
LREC
2010
180views Education» more  LREC 2010»
13 years 6 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...