메뉴 건너뛰기




Volumn 1, Issue , 2012, Pages 440-448

Bayesian symbol-refined tree substitution grammars for syntactic parsing

Author keywords

[No Author keywords available]

Indexed keywords

DISCRIMINATIVE RERANKING; MARKOV CHAIN MONTE CARLO; MODEL-BASED OPC; NON-TERMINAL SYMBOLS; SYNTACTIC PARSING; TRAINING METHODS; TREE SUBSTITUTION GRAMMARS; WALL STREET JOURNAL;

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

References (31)
  • 1
    • 80053292929 scopus 로고    scopus 로고
    • Simple, accurate parsing with an all-fragments grammar
    • Mohit Bansal and Dan Klein. 2010. Simple, Accurate Parsing with an All-Fragments Grammar. In In Proc. of ACL, pages 1098-1107.
    • (2010) Proc. of ACL , pp. 1098-1107
    • Bansal, M.1    Klein, D.2
  • 2
    • 80053265528 scopus 로고    scopus 로고
    • Unsupervised induction of tree substitution grammars for dependency parsing
    • Phil Blunsom and Trevor Cohn. 2010. Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing. In Proc. of EMNLP, pages 1204-1213.
    • (2010) Proc. of EMNLP , pp. 1204-1213
    • Blunsom, P.1    Cohn, T.2
  • 3
    • 84859885240 scopus 로고    scopus 로고
    • Coarseto- fine n-best parsing and maxent discriminative reranking
    • Eugene Charniak and Mark Johnson. 2005. Coarseto- Fine n-Best Parsing and MaxEnt Discriminative Reranking. In Proc. of ACL, 1:173-180.
    • (2005) Proc. of ACL , vol.1 , pp. 173-180
    • Charniak, E.1    Johnson, M.2
  • 4
    • 84858420212 scopus 로고    scopus 로고
    • Variational inference for adaptor grammars
    • Shay B Cohen, David M Blei, and Noah A Smith. 2010. Variational Inference for Adaptor Grammars. In In Proc. of HLT-NAACL, pages 564-572.
    • (2010) Proc. of HLT-NAACL , pp. 564-572
    • Cohen, S.B.1    Blei, D.M.2    Smith, N.A.3
  • 7
    • 4043082208 scopus 로고    scopus 로고
    • Head-driven statistical models for natural language parsing
    • Michael Collins. 2003. Head-Driven Statistical Models for Natural Language Parsing. Computational Linguistics, 29:589-637.
    • (2003) Computational Linguistics , vol.29 , pp. 589-637
    • Collins, M.1
  • 8
    • 80053238364 scopus 로고    scopus 로고
    • Synchronous tree adjoining machine translation
    • Steve DeNeefe and Kevin Knight. 2009. Synchronous Tree Adjoining Machine Translation. In Proc. of EMNLP, page 727.
    • (2009) Proc. of EMNLP , pp. 727
    • Deneefe, S.1    Knight, K.2
  • 9
    • 0001120413 scopus 로고
    • A bayesian analysis of some nonparametric problems
    • Thomas S Ferguson. 1973. A Bayesian Analysis of Some Nonparametric Problems. Annals of Statistics, 1:209-230.
    • (1973) Annals of Statistics , vol.1 , pp. 209-230
    • Ferguson, T.S.1
  • 10
    • 79551518140 scopus 로고    scopus 로고
    • Combining constituent parsers
    • Victoria Fossum and Kevin Knight. 2009. Combining Constituent Parsers. In Proc. of HLT-NAACL, pages 253-256.
    • (2009) Proc. of HLT-NAACL , pp. 253-256
    • Fossum, V.1    Knight, K.2
  • 12
    • 84859887879 scopus 로고    scopus 로고
    • Forest reranking : Discriminative parsing with non-local features
    • Liang Huang. 2008. Forest Reranking : Discriminative Parsing with Non-Local Features. In Proc. of ACL, 19104:0.
    • (2008) Proc. of ACL , pp. 19104
    • Huang, L.1
  • 13
    • 84863393433 scopus 로고    scopus 로고
    • Improving nonparameteric bayesian inference: Experiments on unsupervised word segmentation with adaptor grammars
    • Mark Johnson and Sharon Goldwater. 2009. Improving nonparameteric Bayesian inference: experiments on unsupervised word segmentation with adaptor grammars. In In Proc. of HLT-NAACL, pages 317-325.
    • (2009) Proc. of HLT-NAACL , pp. 317-325
    • Johnson, M.1    Goldwater, S.2
  • 14
    • 67349214856 scopus 로고    scopus 로고
    • Adaptor grammars : A framework for specifying compositional nonparametric bayesian models
    • Mark Johnson, Thomas L Griffiths, and Sharon Goldwater. 2007a. Adaptor Grammars : A Framework for Specifying Compositional Nonparametric Bayesian Models. Advances in Neural Information Processing Systems 19, 19:641-648.
    • (2007) Advances in Neural Information Processing Systems , vol.19 , Issue.19 , pp. 641-648
    • Johnson, M.1    Griffiths, T.L.2    Goldwater, S.3
  • 15
    • 84863393622 scopus 로고    scopus 로고
    • Bayesian inference for pcfgs via markov chain monte carlo
    • Mark Johnson, Thomas L Griffiths, and Sharon Goldwater. 2007b. Bayesian Inference for PCFGs via Markov chain Monte Carlo. In In Proc. of HLT-NAACL, pages 139-146.
    • (2007) Proc. of HLT-NAACL , pp. 139-146
    • Johnson, M.1    Griffiths, T.L.2    Goldwater, S.3
  • 16
    • 0005921873 scopus 로고    scopus 로고
    • Pcfg models of linguistic tree representations
    • Mark Johnson. 1998. PCFG Models of Linguistic Tree Representations. Computational Linguistics, 24:613- 632.
    • (1998) Computational Linguistics , vol.24 , pp. 613-632
    • Johnson, M.1
  • 17
    • 85146417759 scopus 로고    scopus 로고
    • Accurate unlexicalized parsing
    • Dan Klein and Christopher D Manning. 2003. Accurate Unlexicalized Parsing. In Proc. of ACL, 1:423-430.
    • (2003) Proc. of ACL , vol.1 , pp. 423-430
    • Klein, D.1    Manning, C.D.2
  • 18
    • 0026187099 scopus 로고
    • Applications of stochastic context-free grammars using the inside-outside algorithm
    • K Lari and S J Young. 1991. Applications of Stochastic Context-Free Grammars Using the Inside-Outside Algorithm. Computer Speech and Language, 5:237- 257.
    • (1991) Computer Speech and Language , vol.5 , pp. 237-257
    • Lari, K.1    Young, S.J.2
  • 19
    • 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:313-330.
    • (1993) Computational Linguistics , vol.19 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Marcinkiewicz, M.A.3
  • 20
    • 84859896044 scopus 로고    scopus 로고
    • Probabilistic cfg with latent annotations
    • Takuya Matsuzaki, Yusuke Miyao, and Jun'ichi Tsujii. 2005. Probabilistic CFG with latent annotations. In Proc. of ACL, pages 75-82.
    • (2005) Proc. of ACL , pp. 75-82
    • Matsuzaki, T.1    Miyao, Y.2    Tsujii, J.3
  • 21
    • 36348934026 scopus 로고    scopus 로고
    • Learning accurate, compact, and interpretable tree annotation
    • Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. 2006. Learning Accurate, Compact, and Interpretable Tree Annotation. In Proc. of ACL, pages 433-440.
    • (2006) Proc. of ACL , pp. 433-440
    • Petrov, S.1    Barrett, L.2    Thibaux, R.3    Klein, D.4
  • 22
    • 79551488594 scopus 로고    scopus 로고
    • Products of random latent variable grammars
    • Slav Petrov. 2010. Products of Random Latent Variable Grammars. In Proc. of HLT-NAACL, pages 19-27.
    • (2010) Proc. of HLT-NAACL , pp. 19-27
    • Petrov, S.1
  • 23
    • 0031534984 scopus 로고    scopus 로고
    • The two-parameter poisson-dirichlet distribution derived from a stable subordinator
    • Jim Pitman and Marc Yor. 1997. The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator. The Annals of Probability, 25:855-900.
    • (1997) The Annals of Probability , vol.25 , pp. 855-900
    • Pitman, J.1    Yor, M.2
  • 24
    • 79551489970 scopus 로고    scopus 로고
    • Bayesian learning of a tree substitution grammar
    • Matt Post and Daniel Gildea. 2009. Bayesian Learning of a Tree Substitution Grammar. In In Proc. of ACLIJCNLP, pages 45-48.
    • (2009) Proc. of ACLIJCNLP , pp. 45-48
    • Post, M.1    Gildea, D.2
  • 26
    • 38049151407 scopus 로고    scopus 로고
    • A hierarchical bayesian language model based on pitman-yor processes
    • YW Teh. 2006b. A Hierarchical Bayesian Language Model based on Pitman-Yor Processes. In Proc. of ACL, 44:985-992.
    • (2006) Proc. of ACL , vol.44 , pp. 985-992
    • Teh, Y.W.1
  • 28
    • 80053356836 scopus 로고    scopus 로고
    • What is the jeopardy model ? a quasi- synchronous grammar for qa
    • Mengqiu Wang, Noah A Smith, and Teruko Mitamura. 2007. What is the Jeopardy Model ? A Quasi- Synchronous Grammar for QA. In Proc. of EMNLPCoNLL, pages 22-32.
    • (2007) Proc. of EMNLPCoNLL , pp. 22-32
    • Wang, M.1    Smith, N.A.2    Mitamura, T.3
  • 29
    • 79960613531 scopus 로고    scopus 로고
    • Bayesian synchronous tree-substitution grammar induction and its application to sentence compression
    • Elif Yamangil and Stuart M Shieber. 2010. Bayesian Synchronous Tree-Substitution Grammar Induction and Its Application to Sentence Compression. In In Proc. of ACL, pages 937-947.
    • (2010) Proc. of ACL , pp. 937-947
    • Yamangil, E.1    Shieber, S.M.2
  • 30
    • 78649295943 scopus 로고    scopus 로고
    • K-best combination of syntactic parsers
    • Hui Zhang, Min Zhang, Chew Lim Tan, and Haizhou Li. 2009. K-Best Combination of Syntactic Parsers. In Proc. of EMNLP, pages 1552-1560.
    • (2009) Proc. of EMNLP , pp. 1552-1560
    • Zhang, H.1    Zhang, M.2    Tan, C.L.3    Li, H.4
  • 31
    • 77953193320 scopus 로고    scopus 로고
    • Parsimonious data-oriented parsing
    • Willem Zuidema. 2007. Parsimonious Data-Oriented Parsing. In Proc. of EMNLP-CoNLL, pages 551-560.
    • (2007) Proc. of EMNLP-CoNLL , pp. 551-560
    • Zuidema, W.1


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