Learning to summarise related sentences

COLING 2014 - 25th International Conference on Computational Linguistics, Proceedings of COLING 2014: Technical Papers

Volumn , Issue , 2014, Pages 1636-1647

  Tzouridis, Emmanouil ^a   Nasir, Jamal Abdul ^b   Brefeld, Ulf ^a,c  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b LAHORE UNIVERSITY OF MANAGEMENT SCIENCES   (Pakistan)

^c DIPF Frankfurt Main   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACTION; COMPUTATIONAL LINGUISTICS; DATA COMPRESSION; GRAPHIC METHODS; LINGUISTICS; POLYNOMIAL APPROXIMATION;

GENERALISED LINEAR MODELS; LARGE MARGINS; POLYNOMIAL-TIME; SENTENCE COMPRESSION; SHORTEST PATH; SHORTEST PATH ALGORITHMS; STATE OF THE ART; STRUCTURED PREDICTION;

GRAPH THEORY;

EID: 84943749207     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)

1. R. Barzilay and L. Lee. 2003. Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence Alignment, Proceedings of NAACL-HLT.
2. R. Barzilay and K. R. McKeown. 2005. Sentence Fusion for Multidocument News Summarization, Comput. Linguist. 31(3), 297-328.
3. P. Baxendale 1958. Machine-made index for technical literature - An experiment, IBM Journal of Research Development, 2(4):354-361.
4. R. Bellman 1958. On a routing problem, Quarterly of Applied Mathematics 16:87-90.
5. F. Boudin and E. Morin. 2013 Keyphrase Extraction for N-best reranking in multi-sentence compression, Proceedigs of NAACL-HLT.
6. G. Bouma. 2009. Normalized (pointwise) Mutual information in collocation extraction, Proceedings of GSCL.
7. J. Clarke and M. Lapata. 2008. Global inference for sentence compression: An integer linear programming approach, Journal of Artificial Intelligence Research, 31:399-429.
8. S. H. Corston-Oliver 2001. Text compaction for display on very small screens, Proceedings of the NAACL Workshop on Automatic Summarization.
9. E. W. Dijkstra 1959. A note on two problems in connexion with graphs, Numerische Mathematik 1:269-271.
10. B. Dorr, D. Zajic, and R. Schwartz. 2003. Hedge trimmer: A parse-and-trim approach to headline generation, Proceedings of the HLT-NAACL Workshop on Text Summarization.
11. H. P. Edmundson 1969. New methods in automatic extracting, Journal of the ACM, 16(2):264-285.
12. C. Fellbaum (Ed.). 1998. WordNet: An Electronic Lexical Database, Cambridge, MA: MIT Press.
13. K. Filippova. 2010. Multi-sentence compression: Finding shortest paths in word graphs, Proceedings of COLING.
14. K. Filippova and M. Strube. 2008. Dependency tree based sentence compression, Proceedings of INLG.
15. J. Ford, R. Lester 1956. Network Flow Theory, Paper P-923, Santa Monica, California: RAND Corporation.
16. M. Galley and K. R. McKeown. 2007. Lexicalized Markov grammars for sentence compression, Proceedings of NAACL-HLT.
17. U. Hermjakob, A. Echihabi, and D. Marcu. 2002. Natural language based reformulation resource and wide exploitation for question answering, Proceedings of the Text Retrieval Conference.
18. C. Hori, S. Furui, R. Malkin, H. Yu, and A. Waibel. 2003. A statistical approach to automatic speech summarization, EURASIP Journal on Applied Signal Processing, 2:128-139.
19. H. Jing 2000. Sentence reduction for automatic text summarization, Proc. of ANLP.
20. H. Jing and K. McKeown. 2000. Cut and paste based text summarization, Proc. of NAACL.
21. N. Kaji, M. Okamoto, and S. Kurohashi, . 2004. Paraphrasing predicates from written language to spoken language using the web, Proceedings of HLT-NAACL.
22. J. Kupiec, J. Pedersen, and F. Chen 1995 A trainable document summarizer, Proceedings of SIGIR.
23. C. Lin. 2003. Improving summarization performance by sentence compression - A pilot study, Proceedings of the Int. Workshop on Information Retrieval with Asian Language.
24. C. Lin. 2004. Rouge: A package for automatic evaluation of summaries, Proceedings of the ACL Workshop on Text Summarization Branches Out.
25. C.-Y. Lin and E. H. Hovy. 2003. Automatic Evaluation of Summaries Using N-gram Co-occurrence Statistics, Proceedings of HLT-NAACL.
26. H.P. Luhn. 1958. The Automatic Creation of Literature Abstracts, IBM Journal of Research and Development 2(2), 159-165.
27. I. Mani. 2001. Automatic Summarization, Amsterdam, Philadelphia: John Benjamins.
28. D. Marcu. 1997 The Rhetorical Parsing of Natural Language Texts, Proceedings of ACL/EACL.
29. K. R. McKeown, J. Hirschberg, M. Galley, and S. Maskey. 2005. From Text to Speech Summarization, Proceedings of ICASSP.
30. G. A. Miller. 1995. WordNet: A lexical database for English, Communications of the ACM Vol. 38, No. 11: 39-41.
31. A. Nenkova, L. Vanderwende, and K. McKeown. 2006. A compositional context sensitive multi-document summarizer: exploring the factors that influence summarization, Proceedings of SIGIR.
32. K. Owczarzak, J. M. Conroy, H. T. Dang, and A. Nenkova. 2012. An assessment of the accuracy of automatic evaluation in summarization, Proceedings of the Workshop on Evaluation Metrics and System Comparison for Automatic Summarization.
33. K. Papineni, S. Roukos, T. Ward, and W. J. Zhu. 2002. BLEU: A method for automatic evaluation of machine translation, Proceedings of ACL.
34. D. Roussinov and H. Chen. 2001 Information Navigation on the Web by Clustering and Summarizing Query Results, Information Processing and Management, 37 (6), 789-816.
35. G. Salton, J. Allan, C. Buckley, and A. Singhal, 1994 Automatic Analysis, Theme Generation, and Summarization of Machine-Readable Texts, Science 264(5164), 1421-1426.
36. B. Taskar and D. Klein and M. Collins and D. Koller and C. Manning. 2004. Max-margin parsing, Proceedings of EMNLP, 2004.
37. S. Teufel and M. Moens. 1997 sentence extraction as a classification task, Proceedings of the ACL/EACL Workshop on Intelligent and Scalable Text Summarization.
38. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. 2005. Large margin methods for structured and interdependent output variables, JMLR, 6 (Sep):1453-1484.
39. P. D. Turney. 2000. Learning algorithms for keyphrase extraction, Information Retrieval 2(4), 303-336.
40. S. Wan, R. Dale, M. Dras, C. Paris. 2007. Global revision in summarisation : generating novel sentences with Prim's algorithm, Proceedings of PACLING.
41. J. Y. Yen. 1971. Finding the k shortest loopless paths in a network, Management Science 17 (11): 712-716.
42. M. Zinkevich, M. Weimer, A. Smola, and L. Li. 2011. Parallelized stochastic gradient descent, Proceedings of NIPS.