메뉴 건너뛰기




Volumn 1, Issue , 2013, Pages 1384-1394

A sentence compression based framework to query-focused multi-document summarization

Author keywords

[No Author keywords available]

Indexed keywords

COMPACTION; COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (51)
  • 1
    • 0000759069 scopus 로고
    • Syntax directed translations and the pushdown assembler
    • Alfred V. Aho and Jeffrey D. Ullman. 1969. Syntax directed translations and the pushdown assembler. J. Comput. Syst. Sci., 3(1):37-56.
    • (1969) J. Comput. Syst. Sci. , vol.3 , Issue.1 , pp. 37-56
    • Aho, A.V.1    Ullman, J.D.2
  • 2
    • 1642390959 scopus 로고    scopus 로고
    • Inferring strategies for sentence ordering in multidocument news summarization
    • August
    • Regina Barzilay, Noemie Elhadad, and Kathleen R. McKeown. 2002. Inferring strategies for sentence ordering in multidocument news summarization. J. Artif. Int. Res., 17(1):35-55, August.
    • (2002) J. Artif. Int. Res. , vol.17 , Issue.1 , pp. 35-55
    • Barzilay, R.1    Elhadad, N.2    McKeown, K.R.3
  • 4
    • 0002652285 scopus 로고    scopus 로고
    • A maximum entropy approach to natural language processing
    • March
    • Adam L. Berger, Vincent J. Della Pietra, and Stephen A. Della Pietra. 1996. A maximum entropy approach to natural language processing. Comput. Linguist., 22(1):39-71, March.
    • (1996) Comput. Linguist. , vol.22 , Issue.1 , pp. 39-71
    • Berger, A.L.1    Della Pietra, V.J.2    Della Pietra, S.A.3
  • 7
    • 84864039510 scopus 로고    scopus 로고
    • Learning to rank with nonsmooth cost functions
    • B. Schölkopf, J. Platt, and T. Hoffman, editors, MIT Press, Cambridge, MA
    • Christopher J. C. Burges, Robert Ragno, and Quoc Viet Le. 2007. Learning to rank with nonsmooth cost functions. In B. Schölkopf, J. Platt, and T. Hoffman, editors, Advances in Neural Information Processing Systems 19, pages 193-200. MIT Press, Cambridge, MA.
    • (2007) Advances in Neural Information Processing Systems 19 , pp. 193-200
    • Burges, C.J.C.1    Ragno, R.2    Le Viet, Q.3
  • 10
    • 44449150380 scopus 로고    scopus 로고
    • Global inference for sentence compression an integer linear programming approach
    • March
    • James Clarke and Mirella Lapata. 2008. Global inference for sentence compression an integer linear programming approach. J. Artif. Int. Res., 31(1):399-429, March.
    • (2008) J. Artif. Int. Res. , vol.31 , Issue.1 , pp. 399-429
    • Clarke, J.1    Lapata, M.2
  • 16
    • 80053408947 scopus 로고    scopus 로고
    • Bayesian query-focused summarization
    • Stroudsburg, PA, USA. Association for Computational Linguistics
    • Hal Daumé, III and Daniel Marcu. 2006. Bayesian query-focused summarization. ACL'06, pages 305-312, Stroudsburg, PA, USA. Association for Computational Linguistics.
    • (2006) ACL'06 , pp. 305-312
    • Daumé III, H.1    Marcu, D.2
  • 17
    • 84873158306 scopus 로고    scopus 로고
    • Occams - An optimal combinatorial covering algorithm for multi-document summarization
    • Sashka T. Davis, John M. Conroy, and Judith D. Schlesinger. 2012. Occams - an optimal combinatorial covering algorithm for multi-document summarization. In ICDM Workshops, pages 454-463.
    • (2012) ICDM Workshops , pp. 454-463
    • Davis, S.T.1    Conroy, J.M.2    Schlesinger, J.D.3
  • 18
    • 10644256063 scopus 로고    scopus 로고
    • Hedge trimmer: A parse-and-trim approach to headline generation
    • Stroudsburg, PA, USA. Association for Computational Linguistics, Association for Computational Linguistics
    • Bonnie J Dorr, David Zajic, and Richard Schwartz. 2003. Hedge trimmer: a parse-and-trim approach to headline generation. In Proceedings of the HLT-NAACL 03 on Text summarization workshop - Volume 5, HLT-NAACL-DUC'03, pages 1-8, Stroudsburg, PA, USA. Association for Computational Linguistics, Association for Computational Linguistics.
    • (2003) Proceedings of the HLT-NAACL 03 on Text Summarization Workshop - Volume 5, HLT-NAACL-DUC'03 , pp. 1-8
    • Dorr, B.J.1    Zajic, D.2    Schwartz, R.3
  • 19
    • 27344433526 scopus 로고    scopus 로고
    • Lexrank: Graphbased lexical centrality as salience in text summarization
    • December
    • Gunes Erkan and Dragomir R. Radev. 2004. Lexrank: graphbased lexical centrality as salience in text summarization. J. Artif. Int. Res., 22(1):457-479, December.
    • (2004) J. Artif. Int. Res. , vol.22 , Issue.1 , pp. 457-479
    • Erkan, G.1    Radev, D.R.2
  • 22
    • 77956328274 scopus 로고    scopus 로고
    • Lexicalized Markov grammars for sentence compression
    • Rochester, New York, April. Association for Computational Linguistics
    • Michel Galley and Kathleen McKeown. 2007. Lexicalized Markov grammars for sentence compression. NAACL'07, pages 180-187, Rochester, New York, April. Association for Computational Linguistics.
    • (2007) NAACL'07 , pp. 180-187
    • Galley, M.1    McKeown, K.2
  • 29
    • 10644277499 scopus 로고    scopus 로고
    • Statistics-based summarization - Step one: Sentence compression
    • AAAI Press
    • Kevin Knight and Daniel Marcu. 2000. Statistics-based summarization - step one: Sentence compression. AAAI'00, pages 703-710. AAAI Press.
    • (2000) AAAI'00 , pp. 703-710
    • Knight, K.1    Marcu, D.2
  • 31
  • 32
    • 80155135415 scopus 로고
    • Syntax-directed transduction
    • July
    • P. M. Lewis, II and R. E. Stearns. 1968. Syntax-directed transduction. J. ACM, 15(3):465-488, July.
    • (1968) J. ACM , vol.15 , Issue.3 , pp. 465-488
    • Lewis II, P.M.1    Stearns, R.E.2
  • 34
    • 0038375892 scopus 로고    scopus 로고
    • The automated acquisition of topic signatures for text summarization
    • Stroudsburg, PA, USA. Association for Computational Linguistics
    • Chin-Yew Lin and Eduard Hovy. 2000. The automated acquisition of topic signatures for text summarization. In Proceedings of the 18th conference on Computational linguistics - Volume 1, COLING'00, pages 495-501, Stroudsburg, PA, USA. Association for Computational Linguistics.
    • (2000) Proceedings of the 18th Conference on Computational Linguistics - Volume 1, COLING'00 , pp. 495-501
    • Lin, C.-Y.1    Hovy, E.2
  • 37
    • 38149113090 scopus 로고    scopus 로고
    • Multi-lingual coreference resolution with syntactic features
    • Xiaoqiang Luo and Imed Zitouni. 2005. Multi-lingual coreference resolution with syntactic features. In HLT/EMNLP.
    • (2005) HLT/EMNLP
    • Luo, X.1    Zitouni, I.2
  • 38
    • 85015851164 scopus 로고    scopus 로고
    • A mentionsynchronous coreference resolution algorithm based on the bell tree
    • Xiaoqiang Luo, Abraham Ittycheriah, Hongyan Jing, Nanda Kambhatla, and Salim Roukos. 2004. A mentionsynchronous coreference resolution algorithm based on the bell tree. In ACL, pages 135-142.
    • (2004) ACL , pp. 135-142
    • Luo, X.1    Ittycheriah, A.2    Jing, H.3    Kambhatla, N.4    Roukos, S.5
  • 41
    • 84893398389 scopus 로고    scopus 로고
    • Discriminative sentence compression with soft syntactic constraints
    • Trento, Italy, April
    • Ryan McDonald. 2006. Discriminative Sentence Compression with Soft Syntactic Constraints. In Proceedings of the 11th̃EACL, Trento, Italy, April.
    • (2006) Proceedings of the 11th̃EACL
    • McDonald, R.1
  • 43
    • 85013202438 scopus 로고    scopus 로고
    • Evaluating content selection in summarization: The pyramid method
    • Daniel Marcu Susan Dumais and Salim Roukos, editors, Boston, Massachusetts, USA, May 2 - May 7. Association for Computational Linguistics
    • Ani Nenkova and Rebecca Passonneau. 2004. Evaluating content selection in summarization: The pyramid method. In Daniel Marcu Susan Dumais and Salim Roukos, editors, HLT-NAACL 2004: Main Proceedings, pages 145-152, Boston, Massachusetts, USA, May 2 - May 7. Association for Computational Linguistics.
    • (2004) HLT-NAACL 2004: Main Proceedings , pp. 145-152
    • Nenkova, A.1    Passonneau, R.2
  • 45
    • 79951942118 scopus 로고    scopus 로고
    • Applying regression models to query-focused multidocument summarization
    • March
    • You Ouyang, Wenjie Li, Sujian Li, and Qin Lu. 2011. Applying regression models to query-focused multidocument summarization. Inf. Process. Manage., 47(2):227-237, March.
    • (2011) Inf. Process. Manage. , vol.47 , Issue.2 , pp. 227-237
    • Ouyang, Y.1    Li, W.2    Li, S.3    Lu, Q.4
  • 47
    • 84863118985 scopus 로고    scopus 로고
    • Learning to rank for queryfocused multi-document summarization
    • Diane J. Cook, Jian Pei, Wei Wang 0010, Osmar R. Zaane, and Xindong Wu, editors, IEEE
    • Chao Shen and Tao Li. 2011. Learning to rank for queryfocused multi-document summarization. In Diane J. Cook, Jian Pei, Wei Wang 0010, Osmar R. Zaane, and Xindong Wu, editors, ICDM, pages 626-634. IEEE.
    • (2011) ICDM , pp. 626-634
    • Shen, C.1    Li, T.2
  • 48
    • 84891308106 scopus 로고    scopus 로고
    • SRILM - An extensible language modeling toolkit
    • Denver, USA
    • Andreas Stolcke. 2002. SRILM - an extensible language modeling toolkit. In Proceedings of ICSLP, volume 2, pages 901-904, Denver, USA.
    • (2002) Proceedings of ICSLP, Volume 2 , pp. 901-904
    • Stolcke, A.1
  • 50
    • 84859919694 scopus 로고    scopus 로고
    • Supervised and unsupervised learning for sentence compression
    • Stroudsburg, PA, USA. Association for Computational Linguistics
    • Jenine Turner and Eugene Charniak. 2005. Supervised and unsupervised learning for sentence compression. ACL'05, pages 290-297, Stroudsburg, PA, USA. Association for Computational Linguistics.
    • (2005) ACL'05 , pp. 290-297
    • Turner, J.1    Charniak, E.2


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