Skip to main content

A Study of Global Inference Algorithms in Multi-document Summarization

  • Conference paper
Advances in Information Retrieval (ECIR 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4425))

Included in the following conference series:

Abstract

In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general framework for inference in summarization. We then present three algorithms: The first is a greedy approximate method, the second a dynamic programming approach based on solutions to the knapsack problem, and the third is an exact algorithm that uses an Integer Linear Programming formulation of the problem. We empirically evaluate all three algorithms and show that, relative to the exact solution, the dynamic programming algorithm provides near optimal results with preferable scaling properties.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Document Understanding Conference (DUC), http://duc.nist.gov

  2. Bramsen, P., et al.: Inducing temporal graphs. In: Proceedings of the Empirical Methods in Natural Language Processing (EMNLP) (2006)

    Google Scholar 

  3. Clarke, J., Lapata, M.: Models for sentence compression: A comparison across domains, training requirements and evaluation measures. In: Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL) (2006)

    Google Scholar 

  4. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)

    Google Scholar 

  5. Dang, H.T.: Overview of duc 2005. In: Proceedings of the Document Understanding Conference (DUC) (2005), http://duc.nist.gov

  6. Daumé III., H., Langford, J., Marcu, D.: Search-based structured prediction (In Submission) (2006)

    Google Scholar 

  7. Edmundson, H.P.: New methods in automatic extracting. Journal of the Association for Computing Machinery 1(23) (1968)

    Google Scholar 

  8. Filatova, E., Hatzivassiloglou, V.: A formal model for information selection in multi-sentence text extraction. In: Proceedings of the International Conference on Computational Linguistics (COLING) (2004)

    Google Scholar 

  9. Goldstein, J., et al.: Multi-document summarization by sentence extraction. In: Proceedings of the ANLP/NAACL Workshop on Automatic Summarization (2000)

    Google Scholar 

  10. Hahn, U., Harman, D. (eds.): Proceedings of the Document Understanding Conference (DUC) (2002), http://duc.nist.gov

  11. Kupiec, J., Pedersen, J., Chen, F.: A trainable document summarizer. In: Proceeding of the Annual Conference of the ACM Special Interest Group on Information Retrieval (SIGIR), ACM Press, New York (1995)

    Google Scholar 

  12. Lin, C.Y., Hovy, E.: Automatic evaluation of summaries using n-gram cooccurrence statistics. In: Proceedings of the Joint Conference on Human Language Technology and North American Chapter of the Association for Computational Linguistics (HLT/NAACL) (2003)

    Google Scholar 

  13. Luhn, P.H.: The automatic creation of literature abstracts. IBM Journal of Research and Development 2(2) (1959)

    Google Scholar 

  14. McKeown, K., et al.: Towards multidocument summarization by reformation: Progress and prospects. In: Proceedings of the Annual Conference of the American Association for Artificial Intelligence (AAAI), AAAI, Menlo Park (1999)

    Google Scholar 

  15. Punyakanok, V., et al.: Semantic role labeling via integer linear programming inference. In: Proceedings of the International Conference on Computational Linguistics (COLING) (2004)

    Google Scholar 

  16. Riedel, S., Clarke, J.: Incremental integer linear programming for non-projective dependency parsing. In: Proceedings of the Empirical Methods in Natural Language Processing (EMNLP) (2006)

    Google Scholar 

  17. Roth, D., Yih, W.: A linear programming formulation for global inference in natural language tasks. In: Proceedings of the Conference on Computational Natural Language Learning (CoNLL) (2004)

    Google Scholar 

  18. Teufel, S., Moens, M.: Sentence extraction as a classification task. In: Proceedings of the ACL/EACL Workshop on Intelligent Scalable Text Summarizaion (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Giambattista Amati Claudio Carpineto Giovanni Romano

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

McDonald, R. (2007). A Study of Global Inference Algorithms in Multi-document Summarization. In: Amati, G., Carpineto, C., Romano, G. (eds) Advances in Information Retrieval. ECIR 2007. Lecture Notes in Computer Science, vol 4425. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71496-5_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71496-5_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71494-1

  • Online ISBN: 978-3-540-71496-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics