Skip to main content

WS-Rank: Bringing Sentences into Graph for Keyword Extraction

  • Conference paper
  • First Online:
Web Technologies and Applications (APWeb 2016)

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

Included in the following conference series:

Abstract

Graph-based method is one of the most efficient unsupervised ways to extract keyword from a single web text. However, rarely did the previous graph-based methods consider the sentence importance. In this paper, we propose a graph-based keyword extractor WS-Rank which brings sentences into graph where sentences are distinctively treated according to their importance. The candidate keywords are extracted through the voting mechanism between words and sentences. To evaluate the experiment, we compare our method with TextRank, a graph-based method which uses the logic distribution relationship only between words. Experiment on 13702 web texts carried out shows that WS-Rank achieves more ideal results with an average F-score of 25.20 %.

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 EPUB and 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

Notes

  1. 1.

    http://nlp.csai.tsinghua.edu.cn/~lzy/#Data.

  2. 2.

    http://ictclas.nlpir.org/.

References

  1. Abilhoa, W.D., de Castro, L.N.: A keyword extraction method from twitter messages represented as graphs. Appl. Math. Comput. 240, 308–325 (2014)

    Google Scholar 

  2. Boudin, F.: A comparison of centrality measures for graph-based keyphrase extraction. In: International Joint Conference on Natural Language Processing (IJCNLP), pp. 834–838 (2013)

    Google Scholar 

  3. Li, L., Su, C., Sun, Y., Xiong, S., Xu, G.: Hashtag biased ranking for keyword extraction from microblog posts. In: Zhang, S., Wirsing, M., Zhang, Z. (eds.) KSEM 2015. LNCS, vol. 9403, pp. 348–359. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25159-2_32

    Chapter  Google Scholar 

  4. Mihalcea, R., Tarau, P.: Textrank: Bringing order into texts. In: Association for Computational Linguistics (2004)

    Google Scholar 

  5. Peng, L., Bin, W., Zhiwei, S., Yachao, C., Hengxun, L.: Tag-textrank: a webpage keyword extraction method based on tags. J. Comput. Res. Dev. 11, 014 (2012)

    Google Scholar 

  6. Wan, X.: Timedtextrank: adding the temporal dimension to multi-document summarization. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 867–868. ACM (2007)

    Google Scholar 

  7. Wan, X., Xiao, J.: Single document keyphrase extraction using neighborhood knowledge. AAAI 8, 855–860 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yue-Sheng Zhu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Yang, F., Zhu, YS., Ma, YJ. (2016). WS-Rank: Bringing Sentences into Graph for Keyword Extraction. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds) Web Technologies and Applications. APWeb 2016. Lecture Notes in Computer Science(), vol 9932. Springer, Cham. https://doi.org/10.1007/978-3-319-45817-5_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45817-5_49

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45816-8

  • Online ISBN: 978-3-319-45817-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics