Skip to main content

Graph-Based Summarization without Redundancy

  • Conference paper
Web Technologies and Applications (APWeb 2014)

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

Included in the following conference series:

Abstract

In this paper we present a new text summarization method based on graph to generate concise summaries for highly redundant documents. By mapping the source documents into a textual graph, we turn the summarization into a new problem of finding the key paths composed by essential information. Unlike the extraction of original sentences, our method regenerates sentences by word nodes in the textual graph. In order to avoid the selection of unreasonable paths with grammatical or semantical problems, some syntax rules are defined to guide the path selecting process, and we merge the common paths shared by different sentences to reduce content redundancy. Evaluation results show that our method can get concise summaries with a higher content accuracy.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Jones, K.S.: Automatic summarizing: factors and directions. Advances in Automatic Text Summarization, 1–12 (1999)

    Google Scholar 

  2. Saggion, H., Poibeau, T.: Automatic text summarization: Past, present and future. Multi-source, Multilingual Information Extraction and Summarization, 3–21 (2013)

    Google Scholar 

  3. Radev, D.R., McKeown, K.R.: Generating natural language summaries from multiple on-line sources. Computational Linguistics 24, 470–500 (1998)

    Google Scholar 

  4. Saggion, H., Lapalme, G.: Generating indicative-informative summaries with sumUM. Computational Linguistics 28, 497–526 (2002)

    Article  Google Scholar 

  5. Gupta, V., Lehal, G.S.: A Survey of Text Summarization Extractive Techniques. Journal of Emerging Technologies in Web Intelligence 2, 258–268 (2010)

    Article  Google Scholar 

  6. Sparck Jones, K.: Automatic summarising: The state of the art. Information Processing and Management 43, 1449–1481 (2007)

    Article  Google Scholar 

  7. Luhn, H.P.: The automatic creation of literature abstracts. IBM Journal of Research and Development 2, 159–165 (1958)

    Article  MathSciNet  Google Scholar 

  8. Salton, G., Buckley, C.: Term-weighting approaches in automatic text retrieval. Information Processing and Management 24, 513–523 (1988)

    Article  Google Scholar 

  9. Lloret, E., Palomar, M.: A gradual combination of features for building automatic summarisation systems. In: Matoušek, V., Mautner, P. (eds.) TSD 2009. LNCS, vol. 5729, pp. 16–23. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Lin, C.Y., Hovy, E.: Identifying topics by position. In: Proceedings of the Fifth Conference on Applied Natural Language Processing, pp. 283–290 (1997)

    Google Scholar 

  11. Edmundson, H.P.: New methods in automatic extracting. Journal of the ACM 16, 264–285 (1969)

    Article  MATH  Google Scholar 

  12. Barzilay, R., Elhadad, M.: Using lexical chains for text summarization. In: Proceedings of the ACL Workshop on Intelligent Scalable Text Summarization, pp. 10–17 (1997)

    Google Scholar 

  13. Teufel, S., Moens, M.: Argumentative classification of extracted sentences as a first step towards flexible abstracting. Advances in Automatic Text Summarization (1999)

    Google Scholar 

  14. Lloret, E., Palomar, M.: Text summarisation in progress: a literature review. Artificial Intelligence Review 37, 1–41 (2012)

    Article  Google Scholar 

  15. Mihalcea, R., Tarau, P.: TextRank: Bringing order into texts. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing, pp. 404–411 (2004)

    Google Scholar 

  16. Erkan, G., Radev, D.R.: LexRank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research 22, 457–479 (2004)

    Google Scholar 

  17. Page, L., Brin, S.: The PageRank citation ranking: Bringing order to the web. Stanford InfoLab (1999), http://ilpubs.stanford.edu:8090/422/

  18. Carbonell, J., Goldstein, J.: The use of MMR, diversity-based reranking for reordering documents and producing summaries. In: Proceedings of ACM SIGIR, pp. 335–336 (1998)

    Google Scholar 

  19. Ganesan, K., Zhai, C.X., Han, J.: Opinosis: a graph-based approach to abstractive summariza-tion of highly redundant opinions. In: Proceedings of the 23rd International Conference on Computational Linguistics, pp. 340–348 (2010)

    Google Scholar 

  20. Lin, C.Y.: Rouge: A package for automatic evaluation of summaries. In: Proceedings of the ACL Text Summarization Workshop, pp. 74–81 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zheng, HT., Bai, SZ. (2014). Graph-Based Summarization without Redundancy. In: Chen, L., Jia, Y., Sellis, T., Liu, G. (eds) Web Technologies and Applications. APWeb 2014. Lecture Notes in Computer Science, vol 8709. Springer, Cham. https://doi.org/10.1007/978-3-319-11116-2_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11116-2_39

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11115-5

  • Online ISBN: 978-3-319-11116-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics