{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:30:10Z","timestamp":1743129010465,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319566597"},{"type":"electronic","value":"9783319566603"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56660-3_32","type":"book-chapter","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T03:20:29Z","timestamp":1490152829000},"page":"367-377","source":"Crossref","is-referenced-by-count":1,"title":["Multi-sentence Compression Using Word Graph and Integer Linear Programming"],"prefix":"10.1007","author":[{"given":"Dung Tran","family":"Tuan","sequence":"first","affiliation":[]},{"given":"Nam","family":"Van Chi","sequence":"additional","affiliation":[]},{"given":"Minh-Quoc","family":"Nghiem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,23]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Nenkova, A., Maskey, S., Liu, Y.: Automatic summarization. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011, pp. 3:1\u20133:86 (2011)","DOI":"10.1561\/1500000015"},{"key":"32_CR2","unstructured":"Genest, P.E., Lapalme, G., Yousfi-Monod, M.: Hextac: the creation of a manual extractive run. G\u00e9n\u00e9ration de r\u00e9sum\u00e9s par abstraction (2013)"},{"key":"32_CR3","unstructured":"Filippova, K.: Multi-sentence compression: finding shortest paths in word graphs. In: COLING 2010, 23rd International Conference on Computational Linguistics, Proceedings of the Conference, 23\u201327 August 2010, pp. 322\u2013330. Beijing, China (2010)"},{"key":"32_CR4","unstructured":"Banerjee, S., Mitra, P., Sugiyama, K.: Multi-document abstractive summarization using ILP based multi-sentence compression. In: Proceedings of the 24th International Conference on Artificial Intelligence, pp. 1208\u20131214 (2015)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Daum\u00e9, III, H., Marcu, D.: A noisy-channel model for document compression. In: Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, pp. 449\u2013456 (2002)","DOI":"10.3115\/1073083.1073159"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Turner, J., Charniak, E.: Supervised and unsupervised learning for sentence compression. In: Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, pp. 290\u2013297 (2005)","DOI":"10.3115\/1219840.1219876"},{"key":"32_CR7","unstructured":"Galley, M., McKeown, K.: Lexicalized markov grammars for sentence compression. In: HLT-NAACL, pp. 180\u2013187 (2007)"},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1613\/jair.2433","volume":"31","author":"J Clarke","year":"2008","unstructured":"Clarke, J., Lapata, M.: Global inference for sentence compression: an integer linear programming approach. J. Artif. Intell. Res. 31, 399\u2013429 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"32_CR9","unstructured":"Thadani, K., McKeown, K.: Sentence compression with joint structural inference. In: Proceedings of the Seventeenth Conference on Computational Natural Language Learning, CoNLL 2013, 8\u20139 August 2013, pp. 65\u201374. Sofia, Bulgaria (2013)"},{"key":"32_CR10","unstructured":"Boudin, F., Morin, E.: Keyphrase extraction for n-best reranking in multi-sentence compression. In: Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, June 9\u201314, 2013, pp. 298\u2013305. Westin Peachtree Plaza Hotel, Atlanta, Georgia, USA (2013)"},{"key":"32_CR11","unstructured":"Mihalcea, R., Tarau, P.: Proceedings of EMNLP 2004, pp. 404\u2013411 (2004)"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Luong, A., Tran, N., Ung, V., Nghiem, M.: Word graph-based multi-sentence compression: Re-ranking candidates using frequent words. In: 7th International Conference on Knowledge and Systems Engineering, pp. 55\u201360 (2015)","DOI":"10.1109\/KSE.2015.65"},{"key":"32_CR13","unstructured":"Collins, M.: Probabilistic context-free grammars (PCFGs). Lecture Notes (2013)"},{"key":"32_CR14","unstructured":"McKeown, K., Rosenthal, S., Thadani, K., Moore, C.: Time-efficient creation of an accurate sentence fusion corpus. In: Human Language Technologies, pp. 317\u2013320 (2010)"}],"container-title":["Studies in Computational Intelligence","Advanced Topics in Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56660-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T22:07:20Z","timestamp":1568930840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56660-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566597","9783319566603"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56660-3_32","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2017]]}}}