메뉴 건너뛰기




Volumn , Issue , 2012, Pages 810-820

Improving NLP through marginalization of hidden syntactic structure

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY GRAPHS; HIDDEN STRUCTURES; MARKOV RANDOM FIELDS; RELATION EXTRACTION; SEMANTIC ROLE LABELING; SYNTACTIC ANNOTATION; SYNTACTIC REPRESENTATION; SYNTACTIC STRUCTURE;

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

References (29)
  • 1
    • 84859070160 scopus 로고    scopus 로고
    • A comparison of loopy belief propagation and dual decomposition for integrated CCG supertagging and parsing
    • Michael Auli and Adam Lopez. 2011. A comparison of loopy belief propagation and dual decomposition for integrated CCG supertagging and parsing. In ACL, pages 470-480.
    • (2011) ACL , pp. 470-480
    • Auli, M.1    Lopez, A.2
  • 2
    • 57149137628 scopus 로고    scopus 로고
    • Freebase: A col-laboratively created graph database for structuring human knowledge
    • New York, NY, USA. ACM
    • Kurt Bollacker, Colin Evans, Praveen Paritosh, Tim Sturge, and Jamie Taylor. 2008. Freebase: a col-laboratively created graph database for structuring human knowledge. In SIGMOD, pages 1247-1250, New York, NY, USA. ACM.
    • (2008) SIGMOD , pp. 1247-1250
    • Bollacker, K.1    Evans, C.2    Paritosh, P.3    Sturge, T.4    Taylor, J.5
  • 3
    • 84860538788 scopus 로고    scopus 로고
    • Learning to extract relations from the web using minimal supervision
    • Razvan C. Bunescu and Raymond J. Mooney. 2007. Learning to extract relations from the web using minimal supervision. In ACL.
    • (2007) ACL
    • Bunescu, R.C.1    Mooney, R.J.2
  • 4
    • 84974658259 scopus 로고    scopus 로고
    • Computational complexity of problems on probabilistic grammars and transducers
    • Francisco Casacuberta and Colin De La Higuera. 2000. Computational complexity of problems on probabilistic grammars and transducers. In ICGI, pages 15-24.
    • (2000) ICGI , pp. 15-24
    • Casacuberta, F.1    De La Higuera, C.2
  • 5
    • 84856138766 scopus 로고    scopus 로고
    • Discriminative learning over constrained latent representations
    • M. Chang, D. Goldwasser, D. Roth, and V. Srikumar. 2010. Discriminative learning over constrained latent representations. In NAACL.
    • (2010) NAACL
    • Chang, M.1    Goldwasser, D.2    Roth, D.3    Srikumar, V.4
  • 6
    • 85144480129 scopus 로고    scopus 로고
    • Dependency tree kernels for relation extraction
    • Barcelona, Spain
    • Aron Culotta and Jeffery Sorensen. 2004. Dependency tree kernels for relation extraction. In ACL, Barcelona, Spain.
    • (2004) ACL
    • Culotta, A.1    Sorensen, J.2
  • 7
    • 84858388176 scopus 로고    scopus 로고
    • Joint parsing and named entity recognition
    • Jenny Rose Finkel and Christopher D. Manning. 2009. Joint parsing and named entity recognition. In NAACL, pages 326-334.
    • (2009) NAACL , pp. 326-334
    • Finkel, J.R.1    Manning, C.D.2
  • 8
    • 0001492251 scopus 로고    scopus 로고
    • Minimum bayes risk automatic speech recognition
    • Vaibbhava Goel and William J. Byrne. 2000. Minimum Bayes risk automatic speech recognition. Computer Speech and Language, 14(2):115-135.
    • (2000) Computer Speech and Language , vol.14 , Issue.2 , pp. 115-135
    • Goel, V.1    Byrne, W.J.2
  • 9
    • 85149112297 scopus 로고    scopus 로고
    • Parsing algorithms and metrics
    • Joshua T. Goodman. 1996. Parsing algorithms and metrics. In ACL, pages 177-183.
    • (1996) ACL , pp. 177-183
    • Goodman, J.T.1
  • 11
    • 85156206534 scopus 로고    scopus 로고
    • Fast exact inference with a factored model for natural language processing
    • Dan Klein and Chris Manning. 2002. Fast exact inference with a factored model for natural language processing. In NIPS.
    • (2002) NIPS
    • Klein, D.1    Manning, C.2
  • 12
    • 85117703506 scopus 로고    scopus 로고
    • Minimum bayes-risk decoding for statistical machine translation
    • Shankar Kumar and William Byrne. 2004. Minimum Bayes-risk decoding for statistical machine translation. In HLT-NAACL, pages 169-176.
    • (2004) HLT-NAACL , pp. 169-176
    • Kumar, S.1    Byrne, W.2
  • 13
    • 80053264636 scopus 로고    scopus 로고
    • Unsupervised induction of semantic roles
    • Joel Lang and Mirella Lapata. 2010. Unsupervised induction of semantic roles. In HLT-NAACL, pages 939-947.
    • (2010) HLT-NAACL , pp. 939-947
    • Lang, J.1    Lapata, M.2
  • 14
    • 85186084456 scopus 로고    scopus 로고
    • Variational decoding for statistical machine translation
    • Zhifei Li, Jason Eisner, and Sanjeev Khudanpur. 2009. Variational decoding for statistical machine translation. In ACL, pages 593-601.
    • (2009) ACL , pp. 593-601
    • Li, Z.1    Eisner, J.2    Khudanpur, S.3
  • 15
    • 80053147630 scopus 로고    scopus 로고
    • Variational algorithms for marginal MAP
    • Qiang Liu and Alexander Ihler. 2011. Variational algorithms for marginal MAP. In UAI, pages 453-462.
    • (2011) UAI , pp. 453-462
    • Liu, Q.1    Ihler, A.2
  • 16
    • 56449097408 scopus 로고    scopus 로고
    • A better n-best list: Practical determinization of weighted finite tree automata
    • Jonathan May and Kevin Knight. 2006. A better n-best list: Practical determinization of weighted finite tree automata. In HLT-NAACL, pages 351-358.
    • (2006) HLT-NAACL , pp. 351-358
    • May, J.1    Knight, K.2
  • 17
    • 44849098451 scopus 로고    scopus 로고
    • A conditional random field for discriminatively-trained finite-state string edit distance
    • Andrew McCallum, Kedar Bellare, and Fernando C. N. Pereira. 2005. A conditional random field for discriminatively-trained finite-state string edit distance. In UAI, pages 388-395.
    • (2005) UAI , pp. 388-395
    • McCallum, A.1    Bellare, K.2    Pereira, F.C.N.3
  • 18
    • 80053274459 scopus 로고    scopus 로고
    • Non-projective dependency parsing using spanning tree algorithms
    • Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajic. 2005. Non-projective dependency parsing using spanning tree algorithms. In HLT-EMNLP, pages 523-530.
    • (2005) HLT-EMNLP , pp. 523-530
    • McDonald, R.1    Pereira, F.2    Ribarov, K.3    Hajic, J.4
  • 19
    • 84858379829 scopus 로고    scopus 로고
    • Jointly identifying predicates, arguments and senses using Markov logic
    • Ivan Meza-Ruiz and Sebastian Riedel. 2009. Jointly identifying predicates, arguments and senses using Markov logic. In NAACL.
    • (2009) NAACL
    • Ivan, M.-R.1    Riedel, S.2
  • 20
    • 85184862820 scopus 로고    scopus 로고
    • Distant supervision for relation extraction without labeled data
    • Mike Mintz, Steven Bills, Rion Snow, and Daniel Jurafsky. 2009. Distant supervision for relation extraction without labeled data. In ACL, pages 1003-1011.
    • (2009) ACL , pp. 1003-1011
    • Mintz, M.1    Bills, S.2    Snow, R.3    Jurafsky, D.4
  • 22
    • 0010323861 scopus 로고    scopus 로고
    • Computational complexity of probabilistic disambiguation by means of tree-grammars
    • Khalil Sima'an. 1996. Computational complexity of probabilistic disambiguation by means of tree-grammars. In COLING, pages 1175-1180.
    • (1996) COLING , pp. 1175-1180
    • Sima'an, K.1
  • 23
    • 80053375671 scopus 로고    scopus 로고
    • Dependency parsing by belief propagation
    • David A. Smith and Jason Eisner. 2008. Dependency parsing by belief propagation. In EMNLP, pages 145-156.
    • (2008) EMNLP , pp. 145-156
    • Smith, D.A.1    Eisner, J.2
  • 25
    • 85122620960 scopus 로고    scopus 로고
    • Enriching the knowledge sources used in a maximum entropy part-of-speech tagger
    • Kristina Toutanvoa and Christopher D. Manning. 2000. Enriching the knowledge sources used in a maximum entropy part-of-speech tagger. In EMNLP, pages 63-70.
    • (2000) EMNLP , pp. 63-70
    • Toutanvoa, K.1    Manning, C.D.2
  • 26
    • 84883342186 scopus 로고    scopus 로고
    • Ace 2005 multilingual training corpus. Number ldc2006t06
    • Christopher Walker. 2006. Ace 2005 multilingual training corpus. number ldc2006t06. In Linguistic Data Consortium.
    • (2006) Linguistic Data Consortium
    • Walker, C.1
  • 27
    • 20444401478 scopus 로고    scopus 로고
    • The penn Chinese treebank: Phrase structure annotation of a large corpus
    • Nianwen Xue, Fei Xia, Fu-Dong Chiou, and Martha Palmer. 2005. The penn chinese treebank: Phrase structure annotation of a large corpus. In Natural Language Engineering, pages 207-238.
    • (2005) Natural Language Engineering , pp. 207-238
    • Xue, N.1    Xia, F.2    Chiou, F.-D.3    Palmer, M.4
  • 28
    • 84863368822 scopus 로고    scopus 로고
    • Exploring syntactic features for relation extraction using a convolution tree kernel
    • Min Zhang, Jie Zhang, and Jian Su. 2006. Exploring syntactic features for relation extraction using a convolution tree kernel. In NAACL, pages 288-295.
    • (2006) NAACL , pp. 288-295
    • Zhang, M.1    Zhang, J.2    Su, J.3
  • 29
    • 84859889184 scopus 로고    scopus 로고
    • Exploring various knowledge in relation extraction
    • GuoDong Zhou, Jian Su, Jie Zhang, and Min Zhang. 2005. Exploring various knowledge in relation extraction. In ACL, pages 427-434.
    • (2005) ACL , pp. 427-434
    • GuoDong, Z.1    Su, J.2    Zhang, J.3    Zhang, M.4


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