2007 DocumentSummUsingCRFs

From GM-RKB
Jump to: navigation, search

Subject Headings: Multi-Document Summarization Algorithm.

Notes

Cited By

Quotes

Abstract

Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task as a twoclass classification problem and classify each sentence individually without leveraging the relationship among sentences. The unsupervised methods use heuristic rules to select the most informative sentences into a summary directly, which are hard to generalize. In this paper, we present a Conditional Random Fields (CRF) based framework to keep the merits of the above two kinds of approaches while avoiding their disadvantages. What is more, the proposed framework can take the outcomes of previous methods as features and seamlessly integrate them. The key idea of our approach is to treat the summarization task as a sequence labeling problem. In this view, each document is a sequence of sentences and the summarization procedure labels the sentences by 1 and 0. The label of a sentence depends on the assignment of labels of others. We compared our proposed approach with eight existing methods on an open benchmark data set. The results show that our approach can improve the performance by more than 7.1% and 12.1% over the best supervised baseline and unsupervised baseline respectively in terms of two popular metrics F1 and ROUGE-2. Detailed analysis of the improvement is presented as well.

References

  • 1. Resina Barzilay and Michael Elbadad. Using lexical chains for text summarization. In ISTS, 1997.
  • 2. Sergey Brin, Lawrence Page, The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, v.30 n.1-7, p.107-117, April 1, 1998 doi:10.1016/S0169-7552(98)00110-X
  • 3. Jaime Carbonell, Yibing Geng, and Jade Goldstein. Automated query-relevant summarization and diversity-based reranking. In IJCAI-97 Workshop on AI in Digital Libraries, pages 12-19, Japan, 1997..
  • 4. John M. Conroy, Dianne P. O'leary, Text summarization via hidden Markov models, Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, p.406-407, September 2001, New Orleans, Louisiana, United States doi:10.1145/383952.384042
  • 5. Scott C. Deerwester, Susan T. Dumais, Thomas K. Landauer, George W. Furnas, and Richard A. Harshman. Indexing by latent semantic analysis. JASIS, 41(6):391-407, 1990..
  • 6. Jade Goldstein, Mark Kantrowitz, Vibhu Mittal, Jaime Carbonell, Summarizing text documents: sentence selection and evaluation metrics, Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, p.121-128, August 15-19, 1999, Berkeley, California, United States doi:10.1145/312624.312665.
  • 7. Yihong Gong, Xin Liu, Generic text summarization using relevance measure and latent semantic analysis, Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, p.19-25, September 2001, New Orleans, Louisiana, United States doi:10.1145/383952.383955.
  • 8. Jon M. Kleinberg, Authoritative sources in a hyperlinked environment, Journal of the ACM (JACM), v.46 n.5, p.604-632, Sept. 1999 doi:10.1145/324133.324140.
  • 9. Julian Kupiec, Jan Pedersen, Francine Chen, A trainable document summarizer, Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval, p.68-73, July 09-13, 1995, Seattle, Washington, United States doi:10.1145/215206.215333
  • 10. John D. Lafferty, Andrew McCallum, Fernando C. N. Pereira, Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data, Proceedings of the Eighteenth International Conference on Machine Learning, p.282-289, June 28-July 01, 2001
  • 11. Chin-Yew Lin, Eduard Hovy, Automatic evaluation of summaries using N-gram co-occurrence statistics, Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology, p.71-78, May 27-June 01, 2003, Edmonton, Canada doi:10.3115/1073445.1073465
  • 12. Hans P. Luhn. The automatic creation of literature abstracts. IBM J. of R. and D., 2(2), 1958.
  • 13. Robert Malouf, A comparison of algorithms for maximum entropy parameter estimation, proceedings of the 6th conference on Natural language learning, p.1-7, August 31, 2002 doi:10.3115/1118853.1118871
  • 14. Inderjeet Mani, Eric Bloedorn, Machine learning of generic and user-focused summarization, Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, p.820-826, July 1998, Madison, Wisconsin, United States
  • 15. Mark T. Maybury, Inderjeet Mani, Advances in Automatic Text Summarization, MIT Press, Cambridge, MA, 1999
  • 16. Daniel Marcu. From discourse structures to text summaries. In ACL'97/EACL'97 Workshop on Intelligent Scalable Text Summarization, pages 82-88, 1997.
  • 17. Andrew McCallum, Dayne Freitag, Fernando C. N. Pereira, Maximum Entropy Markov Models for Information Extraction and Segmentation, Proceedings of the Seventeenth International Conference on Machine Learning, p.591-598, June 29-July 02, 2000
  • 18. Rada Mihalcea. Language independent extractive summarization. In AAAI, pages 1688-1689, 2005.
  • 19. Fuchun Peng, Andrew McCallum, Information extraction from research papers using conditional random fields, Information Processing and Management: an International Journal, v.42 n.4, p.963-979, July 2006 doi:10.1016/j.ipm.2005.09.002
  • 20. J.; Pollock and A. Zamora. Automatic abstracting research at chemical abstracts service. JCICS, 15(4), 1975.
  • 21. Lawrence R. Rabiner, A tutorial on hidden Markov models and selected applications in speech recognition, Readings in speech recognition, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1990
  • 22. Fei Sha, Fernando Pereira, Shallow parsing with conditional random fields, Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology, p.134-141, May 27-June 01, 2003, Edmonton, Canada doi:10.3115/1073445.1073473.
  • 23. Dou Shen, Zheng Chen, Qiang Yang, Hua-Jun Zeng, Benyu Zhang, Yuchang Lu, Wei-Ying Ma, Web-page classification through summarization, Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval, July 25-29, 2004, Sheffield, United Kingdom doi:10.1145/1008992.1009035
  • 24. Charles Sutton and Andrew McCallum. An introduction to conditional random fields for relational learning. In Lise Getoor and Ben Taskar, editors, Introduction to Statistical Relational Learning. MIT Press, 2006.
  • 25. C. J. Van Rijsbergen, Information Retrieval, Butterworth-Heinemann, Newton, MA, 1979
  • 26. Jen-Yuan Yeh, Hao-Ren Ke, Wei-Pang Yang, I-Heng Meng, Text summarization using a trainable summarizer and latent semantic analysis, Information Processing and Management: an International Journal, v.41 n.1, p.75-95, January 2005 doi:10.1016/j.ipm.2004.04.003




,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2007 DocumentSummUsingCRFsDocument Summarization Using Conditional Random Fieldshttp://Document Summarization Using Conditional Random Fields