메뉴 건너뛰기




Volumn 1, Issue , 2015, Pages 1253-1262

Machine comprehension with discourse relations

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SYNTACTICS;

EID: 84943741228     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/v1/p15-1121     Document Type: Conference Paper
Times cited : (79)

References (22)
  • 3
    • 0000732463 scopus 로고
    • A limited memory algorithm for bound constrained optimization
    • Richard H Byrd, Peihuang Lu, Jorge Nocedal, and Ciyou Zhu. 1995. A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific Computing, 16(5):1190-1208.
    • (1995) SIAM Journal on Scientific Computing , vol.16 , Issue.5 , pp. 1190-1208
    • Byrd, R.H.1    Lu, P.2    Nocedal, J.3    Zhu, C.4
  • 8
    • 84906932588 scopus 로고    scopus 로고
    • A linear-Time bottom-up discourse parser with constraints and post-editing
    • Long Papers, Baltimore, Maryland, June. Association for Computational Linguistics
    • Vanessa Wei Feng and Graeme Hirst. 2014. A linear-Time bottom-up discourse parser with constraints and post-editing. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 511-521, Baltimore, Maryland, June. Association for Computational Linguistics.
    • (2014) Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics , vol.1 , pp. 511-521
    • Wei Feng, V.1    Hirst, G.2
  • 10
    • 84906923809 scopus 로고    scopus 로고
    • Discourse complements lexical semantics for non-factoid answer reranking
    • Long Papers, Baltimore, Maryland, June. Association for Computational Linguistics
    • Peter Jansen, Mihai Surdeanu, and Peter Clark. 2014. Discourse complements lexical semantics for non-factoid answer reranking. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 977-986, Baltimore, Maryland, June. Association for Computational Linguistics.
    • (2014) Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics , vol.1 , pp. 977-986
    • Jansen, P.1    Surdeanu, M.2    Clark, P.3
  • 11
    • 79952256431 scopus 로고    scopus 로고
    • Recognizing implicit discourse relations in the penn discourse treebank
    • Association for Computational Linguistics
    • Ziheng Lin, Min-Yen Kan, and Hwee Tou Ng. 2009. Recognizing implicit discourse relations in the penn discourse treebank. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1-Volume 1, pages 343-351. Association for Computational Linguistics.
    • (2009) Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing , vol.1 , pp. 343-351
    • Lin, Z.1    Kan, M.2    Tou Ng, H.3
  • 13
    • 84961480199 scopus 로고
    • Rhetorical structure theory: Toward a functional theory of text organization
    • William C Mann and Sandra A Thompson. 1988. Rhetorical structure theory: Toward a functional theory of text organization. Text, 8(3):243-281.
    • (1988) Text , vol.8 , Issue.3 , pp. 243-281
    • Mann, W.C.1    Thompson, S.A.2
  • 19
    • 84926345282 scopus 로고    scopus 로고
    • Mctest: A challenge dataset for the open-domain machine comprehension of text
    • Matthew Richardson, Christopher JC Burges, and Erin Renshaw. 2013. Mctest: A challenge dataset for the open-domain machine comprehension of text. In EMNLP, pages 193-203.
    • (2013) EMNLP , pp. 193-203
    • Richardson, M.1    Burges, C.J.2    Renshaw, E.3
  • 22
    • 33646406015 scopus 로고    scopus 로고
    • Representing discourse coherence: A corpus-based study
    • Florian Wolf and Edward Gibson. 2005. Representing discourse coherence: A corpus-based study. Computational Linguistics, 31(2):249-287.
    • (2005) Computational Linguistics , vol.31 , Issue.2 , pp. 249-287
    • Wolf, F.1    Gibson, E.2


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