Skip to main content

Pazesh: A Graph-Based Approach to Increase Readability of Automatic Text Summaries

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6657))

Included in the following conference series:

  • 1647 Accesses

Abstract

Today, research on automatic text summarization challenges on readability factor as one of the most important aspects of summarizers’ performance. In this paper, we present Pazesh: a language-independent graph-based approach for increasing the readability of summaries while preserving the most important content. Pazesh accomplishes this task by constructing a special path of salient sentences which passes through topic centroid sentences. The results show that Pazesh compares approvingly with previously published results on benchmark datasets.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Salton, G., Singhal, A., Mitra, M., Buckley, C.: Automatic Text Structuring and Summarization. Information Processing and Management Journal 33(2), 193–207 (1997)

    Article  Google Scholar 

  3. Mihalcea, R.: Graph-based ranking algorithms for sentence extraction, applied to text summarization. In: Proceedings of ACL, Spain (2004)

    Google Scholar 

  4. Erkan, G., Radev, D.R.: LexRank: Graph-based Lexical Centrality as Salience in Text Summarization. JAIR 22, 457–479 (2004)

    Google Scholar 

  5. Aker, A., Cohn, T., GaizauskasMulti, R.: Document summarization using A* search and discriminative training. In: Proceedings of EMNLP, USA, pp. 482–491 (2010)

    Google Scholar 

  6. Riedhammer, K., Gillick, D., Favre, B., Hakkani-T, D.: Packing the meeting summarization knapsack. In: Proceedings of the Interspeech Conference, Australia, pp. 2434–2437 (2008)

    Google Scholar 

  7. Barzilay, R., Elhadad, N., McKeown, K.R.: Inferring strategies for sentence ordering in multidocument news summarization. JAIR 17, 35–55 (2002)

    MATH  Google Scholar 

  8. Hearst, M.A.: Texttiling: segmenting text into multi-paragraph subtopic passages. CL 23(1), 33–64 (1997)

    Google Scholar 

  9. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University, USA (1998)

    Google Scholar 

  10. Xiaojun, W., Jianwu, Y., Jianguo, X.: Towards an iterative reinforcement approach for simultaneous document summarization and keyword extraction. In: Proceedings of the 45th ACL, Czech Republic, pp. 552–559 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mostafazadeh, N., Mirroshandel, S.A., Ghassem-Sani, G., Bakhshandeh Babarsad, O. (2011). Pazesh: A Graph-Based Approach to Increase Readability of Automatic Text Summaries. In: Butz, C., Lingras, P. (eds) Advances in Artificial Intelligence. Canadian AI 2011. Lecture Notes in Computer Science(), vol 6657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21043-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21043-3_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21042-6

  • Online ISBN: 978-3-642-21043-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics