Mining the Gaps: Towards Polynomial Summarization

6th International Joint Conference on Natural Language Processing, IJCNLP 2013 - Proceedings of the Main Conference

Volumn , Issue , 2013, Pages 655-660

  Litvak, Marina ^a   Vanetik, Natalia ^a  

^a SAMI SHAMOON COLLEGE OF ENGINEERING   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION;

COLLECTION OF DOCUMENTS; CONVEX POLYTOPES; DOCUMENT SETS; FRACTIONAL POLYNOMIALS; INFORMATION COVERAGE; LINEAR MODELING; LINEAR-PROGRAMMING; MULTI DOCUMENTS SUMMARIZATION; POLYNOMIAL-TIME; TEXT SUMMARISATION;

TEXT PROCESSING;

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

References (13)

1. Berkelaar, M. (1999). lp-solve free software. http://lpsolve.sourceforge.net/5.5/.
2. Giannakopoulos, G., El-Haj, M., Favre, B., Litvak, M., Steinberger, J., and Varma, V. (2011). TAC 2011 MultiLing Pilot Overview. In TAC 2011: Proceedings of Text Analysis Conference.
3. Gillick, D. and Favre, B. (2009). A Scalable Global Model for Summarization. In Proceedings of the NAACL HLT Workshop on Integer Linear Programming for Natural Language Processing, pages 10–18.
4. Hitoshi Nishikawa, Takaaki Hasegawa, Y. M. and Kikui, G. (2010). Opinion Summarization with Integer Linear Programming Formulation for Sentence Extraction and Ordering. In Coling 2010: Poster Volume, pages 910–918.
5. Karmarkar, N. (1984). New polynomial-time algorithm for linear programming. Combinatorica, 4:373–395.
6. Khachiyan, L. G. (1996). Rounding of polytopes in the real number model of computation. Mathematics of Operations Research, 21:307–320.
7. Khachiyan, L. G. and Todd, M. J. (1993). On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Mathematical Programming, 61:137–159.
8. Khuller, S., Moss, A., and Naor, J. S. (1999). The budgeted maximum coverage problem. Information Precessing Letters, 70(1):39–45.
9. Lin, C.-Y. (2004). Rouge: A package for automatic evaluation of summaries. In Proceedings of the Workshop on Text Summarization Branches Out (WAS 2004), pages 25–26.
10. Makino, T., Takamura, H., and Okumura, M. (2011). Balanced coverage of aspects for text summarization. In TAC’11: Proceedings of Text Analysis Conference.
11. Salton, G., Yang, C., and Wong, A. (1975). A vector-space model for information retrieval. Communications of the ACM, 18.
12. Takamura, H. and Okumura, M. (2009). Text summarization model based on maximum coverage problem and its variant. In EACL ’09: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, pages 781–789.
13. Woodsend, K. and Lapata, M. (2010). Automatic Generation of Story Highlights. In ACL’10: Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, pages 565–574.