M\'etodos de Otimiza\c{c}\~ao Combinat\'oria Aplicados ao Problema de Compress\~ao MultiFrases
暂无分享,去创建一个
Juan-Manuel Torres-Moreno | Elvys Linhares Pontes | Thiago Gouveia da Silva | Andr'ea Carneiro Linhares | St'ephane Huet
[1] Regina Barzilay,et al. Sentence Fusion for Multidocument News Summarization , 2005, CL.
[2] Florian Boudin,et al. Keyphrase Extraction for N-best Reranking in Multi-Sentence Compression , 2013, HLT-NAACL.
[3] Rada Mihalcea,et al. TextRank: Bringing Order into Text , 2004, EMNLP.
[4] Michael I. Jordan,et al. Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..
[5] Gábor Pataki,et al. Teaching Integer Programming Formulations Using the Traveling Salesman Problem , 2003, SIAM Rev..
[6] Juan-Manuel Torres-Moreno,et al. LIA-RAG: a system based on graphs and divergence of probabilities applied to Speech-To-Text Summarization , 2016, ArXiv.
[7] Jimmy J. Lin,et al. Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies , 2013 .
[8] Eugene L. Lawler,et al. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .
[9] Temel Öncan,et al. A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..
[10] Juan-Manuel Torres-Moreno,et al. Automatic Text Summarization , 2014 .
[11] Chin-Yew Lin,et al. ROUGE: A Package for Automatic Evaluation of Summaries , 2004, ACL 2004.
[12] Katja Filippova,et al. Multi-Sentence Compression: Finding Shortest Paths in Word Graphs , 2010, COLING.