Probabilistic CFG with latent annotations

ACL-05 - 43rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2005, Pages 75-82

  Matsuzaki, Takuya ^a   Miyao, Yusuke ^a   Tsujii, Jun'ichi ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

EM ALGORITHMS; LATENT VARIABLE; NON-TERMINAL SYMBOLS; NP-HARD; PARSE TREES; PARSED CORPORA; PROBABILISTIC MODELING;

SYNTACTICS;

EID: 84859896044     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1219840.1219850     Document Type: Conference Paper

References (16)

1. Eugene Charniak. 1999. A maximum-entropy-inspired parser. Technical Report CS-99-12.
2. David Chiang and Daniel M. Bikel. 2002. Recovering latent information in treebanks. In Proc. COLING, pages 183-189.
3. Stephen Clark and James R. Curran. 2004. Parsing the wsj using ccg and log-linear models. In Proc. ACL, pages 104-111.
4. Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.
5. Brendan J. Frey, Relu Patrascu, Tommi Jaakkola, and Jodi Moran. 2000. Sequentially fitting "inclusive" trees for inference in noisy-OR networks. In Proc. NIPS, pages 493-499.
6. Joshua Goodman. 1996a. Efficient algorithms for parsing the DOP model. In Proc. EMNLP, pages 143-152.
7. Joshua Goodman. 1996b. Parsing algorithms and metric. In Proc. ACL, pages 177-183.
8. Joshua Goodman. 1997. Probabilistic feature grammars. In Proc. IWPT.
9. James Henderson. 2003. Inducing history representations for broad coverage statistical parsing. In Proc. HLT-NAACL, pages 103-110.
10. Mark Johnson. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24(4):613-632. (Pubitemid 128455527)
11. Dan Klein and Christopher D. Manning. 2003. Accurate unlexicalized parsing. In Proc. ACL, pages 423-430.
12. Fernando Pereira and Yves Schabes. 1992. Insideoutside reestimation from partially bracketed corpora. In Proc. ACL, pages 128-135.
13. Libin Shen. 2004. Nondeterministic LTAG derivation tree extraction. In Proc. TAG+7, pages 199-203.
14. Khalil Simaán. 2002. Computational complexity of probabilistic disambiguation. Grammars, 5(2):125-151.
15. Khalil Simaán. 2003. On maximizing metrics for syntactic disambiguation. In Proc. IWPT.
16. Takehito Utsuro, Syuuji Kodama, and Yuji Matsumoto. 1996. Generalization/specialization of context free grammars based-on entropy of non-terminals. In Proc. JSAI (in Japanese), pages 327-330.