Sciweavers

2836 search results - page 13 / 568
» Parsing Algorithms and Metrics
Sort
View
ACL
2009
13 years 5 months ago
An Earley Parsing Algorithm for Range Concatenation Grammars
We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley pars...
Laura Kallmeyer, Wolfgang Maier, Yannick Parmentie...
TAPD
1998
81views more  TAPD 1998»
13 years 9 months ago
A Generalized CYK Algorithm for Parsing Stochastic CFG
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
Jean-Cédric Chappelier, Martin Rajman
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
ANLP
2000
118views more  ANLP 2000»
13 years 9 months ago
A Novel Use of Statistical Parsing to Extract Information from Text
Since 1995, a few statistical parsing algorithms have demonstrated a breakthrough in parsing accuracy, as measured against the UPenn TREEBANK as a gold standard. In this paper we ...
Scott Miller, Heidi Fox, Lance A. Ramshaw, Ralph M...
JACM
2002
83views more  JACM 2002»
13 years 7 months ago
Fast context-free grammar parsing requires fast boolean matrix multiplication
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
Lillian Lee