메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1146-1156

Training factored PCFGs with expectation propagation

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL EXPLOSION; EXPECTATION PROPAGATION; F1 SCORES; LATENT STRUCTURES; LATENT VARIABLE; LEXICALIZATION; ORDERS OF MAGNITUDE; PER-SYMBOL;

EID: 84883435877     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)

References (33)
  • 3
    • 84926208797 scopus 로고    scopus 로고
    • Fast inference in phrase extraction models with belief propagation
    • David Burkett and Dan Klein. 2012. Fast inference in phrase extraction models with belief propagation. In NAACL.
    • (2012) NAACL
    • Burkett, D.1    Klein, D.2
  • 4
    • 80053288716 scopus 로고    scopus 로고
    • Joint parsing and alignment with weakly synchronized grammars
    • David Burkett, John Blitzer, and Dan Klein. 2010. Joint parsing and alignment with weakly synchronized grammars. In NAACL.
    • (2010) NAACL
    • Burkett, D.1    Blitzer, J.2    Klein, D.3
  • 5
    • 0010191507 scopus 로고
    • A minimalist program for linguistic theory, volume 1
    • MIT, Cambridge Massachusetts
    • Noam Chomsky. 1992. A minimalist program for linguistic theory, Volume 1. MIT Working Papers in Linguistics, MIT, Cambridge Massachusetts.
    • (1992) MIT Working Papers in Linguistics
    • Chomsky, N.1
  • 6
    • 85118152899 scopus 로고    scopus 로고
    • Three generative, lexicalised models for statistical parsing
    • Michael Collins. 1997. Three generative, lexicalised models for statistical parsing. In ACL, pages 16-23.
    • (1997) ACL , pp. 16-23
    • Collins, M.1
  • 7
    • 84859084743 scopus 로고    scopus 로고
    • An alignment algorithm using belief propagation and a structure-based distortion model
    • Fabien Cromières and Sadao Kurohashi. 2009. An alignment algorithm using belief propagation and a structure-based distortion model. In EACL.
    • (2009) EACL
    • Cromières, F.1    Kurohashi, S.2
  • 8
    • 0001391104 scopus 로고
    • Decomposition principle for linear programs
    • G. B. Dantzig and P. Wolfe. 1960. Decomposition principle for linear programs. Operations Research, 8:101-111.
    • (1960) Operations Research , vol.8 , pp. 101-111
    • Dantzig, G.B.1    Wolfe, P.2
  • 10
    • 56149105269 scopus 로고    scopus 로고
    • Better informed training of latent syntactic features
    • July
    • Markus Dreyer and Jason Eisner. 2006. Better informed training of latent syntactic features. In EMNLP, pages 317-326, July.
    • (2006) EMNLP , pp. 317-326
    • Dreyer, M.1    Eisner, J.2
  • 11
    • 80052423377 scopus 로고    scopus 로고
    • Adaptive subgradient methods for online learning and stochastic optimization
    • John Duchi, Elad Hazan, and Yoram Singer. 2010. Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. COLT.
    • (2010) COLT
    • Duchi, J.1    Hazan, E.2    Singer, Y.3
  • 12
    • 72449211489 scopus 로고    scopus 로고
    • Efficient, feature-based, conditional random field parsing
    • Jenny Rose Finkel, Alex Kleeman, and Christopher D. Manning. 2008. Efficient, feature-based, conditional random field parsing. In ACL 2008, pages 959-967.
    • (2008) ACL 2008 , pp. 959-967
    • Finkel, J.R.1    Kleeman, A.2    Manning, C.D.3
  • 14
    • 85149112297 scopus 로고    scopus 로고
    • Parsing algorithms and metrics
    • Joshua Goodman. 1996. Parsing algorithms and metrics. In ACL, pages 177-183.
    • (1996) ACL , pp. 177-183
    • Goodman, J.1
  • 15
    • 85146417759 scopus 로고    scopus 로고
    • Accurate unlexicalized parsing
    • Dan Klein and Christopher D. Manning. 2003. Accurate unlexicalized parsing. In ACL, pages 423-430.
    • (2003) ACL , pp. 423-430
    • Klein, D.1    Manning, C.D.2
  • 16
    • 50649087920 scopus 로고    scopus 로고
    • Mrf optimization via dual decomposition: Message-passing revisited
    • Nikos Komodakis, Nikos Paragios, and Georgios Tziritas. 2007. Mrf optimization via dual decomposition: Message-passing revisited. In ICCV, pages 1-8.
    • (2007) ICCV , pp. 1-8
    • Komodakis, N.1    Paragios, N.2    Tziritas, G.3
  • 18
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Marcinkiewicz, M.A.3
  • 19
    • 84859896044 scopus 로고    scopus 로고
    • Probabilistic CFG with latent annotations
    • Morristown, NJ, USA
    • Takuya Matsuzaki, Yusuke Miyao, and Jun'ichi Tsujii. 2005. Probabilistic CFG with latent annotations. In ACL, pages 75-82, Morristown, NJ, USA.
    • (2005) ACL , pp. 75-82
    • Matsuzaki, T.1    Miyao, Y.2    Tsujii, J.3
  • 20
    • 0345978970 scopus 로고    scopus 로고
    • Expectation propagation for approximate Bayesian inference
    • Thomas P. Minka. 2001. Expectation propagation for approximate Bayesian inference. In UAI, pages 362-369.
    • (2001) UAI , pp. 362-369
    • Minka, T.P.1
  • 22
    • 84858380058 scopus 로고    scopus 로고
    • Improved inference for unlexicalized parsing
    • April
    • Slav Petrov and Dan Klein. 2007. Improved inference for unlexicalized parsing. In NAACL-HLT, April.
    • (2007) NAACL-HLT
    • Petrov, S.1    Klein, D.2
  • 23
    • 85162020178 scopus 로고    scopus 로고
    • Discriminative log-linear grammars with latent variables
    • Slav Petrov and Dan Klein. 2008a. Discriminative log-linear grammars with latent variables. In NIPS, pages 1153-1160.
    • (2008) NIPS , pp. 1153-1160
    • Petrov, S.1    Klein, D.2
  • 24
    • 80053347519 scopus 로고    scopus 로고
    • Sparse multi-scale grammars for discriminative latent variable parsing
    • Honolulu, Hawaii, October
    • Slav Petrov and Dan Klein. 2008b. Sparse multi-scale grammars for discriminative latent variable parsing. In EMNLP, pages 867-876, Honolulu, Hawaii, October.
    • (2008) EMNLP , pp. 867-876
    • Petrov, S.1    Klein, D.2
  • 28
    • 80053227279 scopus 로고    scopus 로고
    • On dual decomposition and linear programming relaxations for natural language processing
    • Cambridge, MA, October
    • Alexander M Rush, David Sontag, Michael Collins, and Tommi Jaakkola. 2010. On dual decomposition and linear programming relaxations for natural language processing. In EMNLP, pages 1-11, Cambridge, MA, October.
    • (2010) EMNLP , pp. 1-11
    • Rush, A.M.1    Sontag, D.2    Collins, M.3    Jaakkola, T.4
  • 29
    • 34548263754 scopus 로고    scopus 로고
    • Exploiting tractable substructures in intractable networks
    • Lawrence Saul and Michael Jordan. 1996. Exploiting tractable substructures in intractable networks. In NIPS 1995.
    • (1996) NIPS 1995
    • Saul, L.1    Jordan, M.2
  • 31
    • 80053375671 scopus 로고    scopus 로고
    • Dependency parsing by belief propagation
    • Honolulu, October
    • David A. Smith and Jason Eisner. 2008. Dependency parsing by belief propagation. In EMNLP, pages 145-156, Honolulu, October.
    • (2008) EMNLP , pp. 145-156
    • Smith, D.A.1    Eisner, J.2
  • 33
    • 3242679207 scopus 로고    scopus 로고
    • A generalized mean field algorithm for variational inference in exponential families
    • Eric P. Xing, Michael I. Jordan, and Stuart J. Russell. 2003. A generalized mean field algorithm for variational inference in exponential families. In UAI, pages 583-591.
    • (2003) UAI , pp. 583-591
    • Xing, E.P.1    Jordan, M.I.2    Russell, S.J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.