Parsing Algorithms and Metrics (1996)

by Joshua Goodman
Venue:IN PROCEEDINGS OF THE 34TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
Citations:78 - 5 self

Documents Related by Co-Citation

396 A New Statistical Parser Based on Bigram Lexical Dependencies – Michael John Collins - 1996
780 Head-Driven Statistical Models for Natural Language Parsing – Michael Collins - 2003
232 Trainable Grammars for Speech Recognition – J Baker - 1979
317 SJ: The estimation of stochastic context-free grammars using the INSIDE-OUTSIDE algorithm. Computer Speech and Language – K Lari, Young - 1990
287 Statistical Decision-Tree Models for Parsing – David M. Magerman - 1995
671 A Maximum-Entropy-Inspired Parser – Eugene Charniak - 1999
174 PCFG Models of Linguistic Tree Representations – Mark Johnson - 1998
240 Inside-outside reestimation from partially bracketed corpora – Fernando Pereira, Yves Schabes - 1992
85 Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars – Khalil Sima'an - 1996
203 Tree-bank Grammars – Eugene Charniak, Eugene Charniak - 1996
261 Coarse-to-fine n-best parsing and MaxEnt discriminative reranking – Eugene Charniak, Mark Johnson - 2005
51 Efficient Algorithms for Parsing the DOP Model – Joshua Goodman - 1996
36 Global Thresholding and Multiple-Pass Parsing – Joshua Goodman - 1997
155 An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities – Andreas Stolcke - 2002
1655 Building a Large Annotated Corpus of English: The Penn Treebank – Mitchell P. Marcus, Beatrice Santorini, Mary Ann Marcinkiewicz - 1993
38 Recovering Latent Information in Treebanks – David Chiang, Daniel M. Bikel - 2002
422 Accurate Unlexicalized Parsing – Dan Klein, Christopher D. Manning - 2003
181 A Gaussian Prior for Smoothing Maximum Entropy Models – Stanley F. Chen, Ronald Rosenfeld - 1999
45 Probabilistic CFG with Latent Annotations – Takuya Matsuzaki, Yusuke Miyao, Jun’ichi Tsujii - 2005