메뉴 건너뛰기




Volumn , Issue , 2007, Pages 632-639

Constituent parsing with Incremental Sigmoid Belief Networks

Author keywords

[No Author keywords available]

Indexed keywords

ERROR REDUCTION; GENERATIVE MODEL; GRAPHICAL MODEL; LATENT VARIABLE; SYNTACTIC PARSING;

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

References (26)
  • 1
    • 25844498898 scopus 로고    scopus 로고
    • Intricacies of Collins' parsing model
    • Dan M. Bikel. 2004. Intricacies of Collins' parsing model. Computational Linguistics, 30(4).
    • (2004) Computational Linguistics , vol.30 , Issue.4
    • Bikel, D.M.1
  • 2
    • 84859885240 scopus 로고    scopus 로고
    • Coarse-tofine n-best parsing and MaxEnt discriminative reranking
    • Ann Arbor, MI
    • Eugene Charniak and Mark Johnson. 2005. Coarse-tofine n-best parsing and MaxEnt discriminative reranking. In Proc. ACL, pages 173-180, Ann Arbor, MI.
    • (2005) Proc. ACL , pp. 173-180
    • Charniak, E.1    Johnson, M.2
  • 3
    • 85036148712 scopus 로고    scopus 로고
    • A maximum-entropy-inspired parser
    • Seattle, Washington
    • Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proc. ACL, pages 132-139, Seattle, Washington.
    • (2000) Proc. ACL , pp. 132-139
    • Charniak, E.1
  • 5
    • 0040044720 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • Stanford, CA
    • Michael Collins. 2000. Discriminative reranking for natural language parsing. In Proc. ICML, pages 175-182, Stanford, CA.
    • (2000) Proc. ICML , pp. 175-182
    • Collins, M.1
  • 8
    • 84859898745 scopus 로고    scopus 로고
    • Data-defined kernels for parse reranking derived from probabilistic models
    • Ann Arbor, MI
    • James Henderson and Ivan Titov. 2005. Data-defined kernels for parse reranking derived from probabilistic models. In Proc. ACL, Ann Arbor, MI.
    • (2005) Proc. ACL
    • Henderson, J.1    Titov, I.2
  • 9
    • 85118708235 scopus 로고    scopus 로고
    • Inducing history representations for broad coverage statistical parsing
    • Edmonton, Canada
    • James Henderson. 2003. Inducing history representations for broad coverage statistical parsing. In Proc. HLT-NAACL, pages 103-110, Edmonton, Canada.
    • (2003) Proc. HLT-NAACL , pp. 103-110
    • Henderson, J.1
  • 10
    • 80053361259 scopus 로고    scopus 로고
    • Discriminative training of a neural network statistical parser
    • Barcelona, Spain
    • James Henderson. 2004. Discriminative training of a neural network statistical parser. In Proc. ACL, Barcelona, Spain.
    • (2004) Proc. ACL
    • Henderson, J.1
  • 11
    • 0029652445 scopus 로고
    • The wake-sleep algorithm for unsupervised neural networks
    • G. Hinton, P. Dayan, B. Frey, and R. Neal. 1995. The wake-sleep algorithm for unsupervised neural networks. Science, 268:1158-1161.
    • (1995) Science , vol.268 , pp. 1158-1161
    • Hinton, G.1    Dayan, P.2    Frey, B.3    Neal, R.4
  • 12
    • 0033225865 scopus 로고    scopus 로고
    • An introduction to variational methods for graphical models
    • Michael I. Jordan, editor, MIT Press, Cambridge, MA
    • M. I. Jordan, Z.Ghahramani, T. S. Jaakkola, and L. K. Saul. 1999. An introduction to variational methods for graphical models. In Michael I. Jordan, editor, Learning in Graphical Models. MIT Press, Cambridge, MA.
    • (1999) Learning in Graphical Models
    • Jordan, M.I.1    Ghahramani, Z.2    Jaakkola, T.S.3    Saul, L.K.4
  • 13
    • 78049407284 scopus 로고    scopus 로고
    • Hidden-variable models for discriminative reranking
    • Vancouver, B.C., Canada
    • Terry Koo and Michael Collins. 2005. Hidden-variable models for discriminative reranking. In Proc. EMNLP, Vancouver, B.C., Canada.
    • (2005) Proc. EMNLP
    • Koo, T.1    Collins, M.2
  • 14
    • 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
  • 15
    • 84859896044 scopus 로고    scopus 로고
    • Probabilistic CFG with latent annotations
    • Ann Arbor, MI
    • Takuya Matsuzaki, Yusuke Miyao, and Jun'ichi Tsujii. 2005. Probabilistic CFG with latent annotations. In Proc. ACL, Ann Arbor, MI.
    • (2005) Proc. ACL
    • Matsuzaki, T.1    Miyao, Y.2    Tsujii, J.3
  • 16
    • 44049116681 scopus 로고
    • Connectionist learning of belief networks
    • Radford Neal. 1992. Connectionist learning of belief networks. Artificial Intelligence, 56:71-113.
    • (1992) Artificial Intelligence , vol.56 , pp. 71-113
    • Neal, R.1
  • 19
    • 85124016637 scopus 로고    scopus 로고
    • A maximum entropy model for part-of-speech tagging
    • Univ. of Pennsylvania, PA
    • Adwait Ratnaparkhi. 1996. A maximum entropy model for part-of-speech tagging. In Proc. EMNLP, pages 133-142, Univ. of Pennsylvania, PA.
    • (1996) Proc. EMNLP , pp. 133-142
    • Ratnaparkhi, A.1
  • 20
    • 85118146972 scopus 로고    scopus 로고
    • Parsing the Wall Street Journal using a Lexical-Functional Grammar and discriminative estimation techniques
    • Philadelphia, PA
    • Stefan Riezler, Tracy H. King, Ronald M. Kaplan, Richard Crouch, John T. Maxwell, and Mark Johnson. 2002. Parsing the Wall Street Journal using a Lexical-Functional Grammar and discriminative estimation techniques. In Proc. ACL, Philadelphia, PA.
    • (2002) Proc. ACL
    • Riezler, S.1    King, T.H.2    Kaplan, R.M.3    Crouch, R.4    Maxwell, J.T.5    Johnson, M.6
  • 22
    • 0003383444 scopus 로고    scopus 로고
    • A mean field learning algorithm for unsupervised neural networks
    • Michael I. Jordan, editor. MIT Press, Cambridge, MA
    • Lawrence K. Saul and Michael I. Jordan. 1999. A mean field learning algorithm for unsupervised neural networks. In Michael I. Jordan, editor, Learning in Graphical Models, pages 541-554. MIT Press, Cambridge, MA.
    • (1999) Learning in Graphical Models , pp. 541-554
    • Saul, L.K.1    Jordan, M.I.2
  • 23
    • 85043116988 scopus 로고    scopus 로고
    • Shallow parsing with conditional random fields
    • Edmonton, Canada
    • Fei Sha and Fernando Pereira. 2003. Shallow parsing with conditional random fields. In Proc. HLT-NAACL, Edmonton, Canada.
    • (2003) Proc. HLT-NAACL
    • Sha, F.1    Pereira, F.2
  • 25
    • 84859914911 scopus 로고    scopus 로고
    • Advances in discriminative parsing
    • Sydney, Australia
    • Joseph Turian and Dan Melamed. 2006. Advances in discriminative parsing. In Proc. COLING-ACL, Sydney, Australia.
    • (2006) Proc. COLING-ACL
    • Turian, J.1    Melamed, D.2
  • 26
    • 0347606818 scopus 로고    scopus 로고
    • More accurate tests for the statistical significance of the result differences
    • Saarbruken, Germany
    • Alexander Yeh. 2000. More accurate tests for the statistical significance of the result differences. In Proc. COLING, pages 947-953, Saarbruken, Germany.
    • (2000) Proc. COLING , pp. 947-953
    • Yeh, A.1


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