{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:39:37Z","timestamp":1742963977285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252247"},{"type":"electronic","value":"9783319252261"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-25226-1_9","type":"book-chapter","created":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T13:33:15Z","timestamp":1470231195000},"page":"103-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using Annotated Suffix Tree Similarity Measure for Text Summarisation"],"prefix":"10.1007","author":[{"given":"Maxim","family":"Yakovlev","sequence":"first","affiliation":[]},{"given":"Ekaterina","family":"Chernyak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,4]]},"reference":[{"key":"9_CR1","unstructured":"Bougouin, A., Boudin, F., & Daille, B. (2013). TopicRank: Graph-based topic tanking for keyphrase extraction. In Proceedings of International Joint Conference on Natural Language Processing (pp. 543\u2013551)."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. In Proceedings of the Seventh International Conference on World Wide Web 7 (pp. 107\u2013117).","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/11816508_63","volume-title":"Advances in natural language processing","author":"F. Cruz","year":"2006","unstructured":"Cruz, F., Troyano, J. A., & Enruquez, F. (2006). Supervised TextRank. In Advances in natural language processing (pp. 632\u2013639). Berlin\/Heidelberg: Springer."},{"key":"9_CR4","unstructured":"Document Understanding Conference. Retrieved October 20, 2014, http:\/\/www-nlpir.nist.gov\/ (Web source)"},{"key":"9_CR5","unstructured":"Enhanced Annotated Suffix Tree . Retrieved January 15, 2015, https:\/\/pypi.python.org\/pypi\/EAST\/0.2.2\/ (Web source)"},{"issue":"1","key":"9_CR6","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1613\/jair.1523","volume":"22","author":"G. Erkan","year":"2004","unstructured":"Erkan, G., & Radev, D. R. (2004). LexRank: graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research, 22(1), 457\u2013479.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Garg, N., Favre, B., Reidhammer, K., & Hakkani-Tur, D. (2009). ClusterRank: a graph based method for meeting summarization. In Interspeech, ISCA (pp. 1499\u20131502).","DOI":"10.21437\/Interspeech.2009-456"},{"key":"9_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences: Computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D. (1997). Algorithms on strings, trees and sequences: Computer science and computational biology. Cambridge: Cambridge University Press."},{"issue":"11","key":"9_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/2.881692","volume":"33","author":"U. Hahn","year":"2000","unstructured":"Hahn, U., & Mani, I. (2000). The challenges of automatic summarization. Computer, 33(11), 29\u201336.","journal-title":"Computer"},{"key":"9_CR10","unstructured":"Mihalcea, R., & Tarau P. (2004). TextRank: bringing order into text. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (pp. 404\u2013411)."},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10994-006-9505-y","volume":"65","author":"R. Pampapathi","year":"2008","unstructured":"Pampapathi, R., Mirkin, B., & Levene, M. (2008). A suffix tree  approach to anti-spam email filtering. Machine Learning, 65(1), 309\u2013338.","journal-title":"Machine Learning"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"M. F. Porter","year":"1980","unstructured":"Porter, M. F. (1980). An algorithm for suffix stripping. Program, 14(3), 130\u2013137.","journal-title":"Program"}],"container-title":["Studies in Classification, Data Analysis, and Knowledge Organization","Analysis of Large and Complex Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25226-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T00:27:24Z","timestamp":1662164844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-25226-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319252247","9783319252261"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25226-1_9","relation":{},"ISSN":["1431-8814","2198-3321"],"issn-type":[{"type":"print","value":"1431-8814"},{"type":"electronic","value":"2198-3321"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"4 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}