Sentence Compression via DC Programming Approach

  • Yi-Shuai NiuEmail author
  • Xi-Wei Hu
  • Yu You
  • Faouzi Mohamed Benammour
  • Hu Zhang
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 991)


Sentence compression is an important problem in natural language processing. In this paper, we firstly establish a new sentence compression model based on the probability model and the parse tree model. Our sentence compression model is equivalent to an integer linear program (ILP) which can both guarantee the syntax correctness of the compression and save the main meaning. We propose using a DC (Difference of convex) programming approach (DCA) for finding local optimal solution of our model. Combing DCA with a parallel-branch-and-bound framework, we can find global optimal solution. Numerical results demonstrate the good quality of our sentence compression model and the excellent performance of our proposed solution algorithm.


Sentence compression Probability model Parse Tree Model DCA Parallel-branch-and-bound 


  1. 1.
    Clarke, J., Lapata, M.: Global inference for sentence compression: an integer linear programming approach. J. Artif. Intell. Res. 31, 399–429 (2008)Google Scholar
  2. 2.
    Gurobi 8.1.0.
  3. 3.
    Jing, H.: Sentence reduction for automatic text summarization. In: Proceedings of the 6th Applied Natural Language Processing Conference, pp. 310–315 (2000)Google Scholar
  4. 4.
    Knight, K., Marcu, D.: Summarization beyond sentence extraction: a probalistic approach to sentence compression. Artif. Intell. 139, 91–107 (2002)Google Scholar
  5. 5.
    Le Thi, H.A., Pham, D.T., Le Dung, M.: Exact penalty in dc programming. Vietnam J. Math. 27(2), 169–178 (1999)Google Scholar
  6. 6.
    Le Thi, H.A., Pham, D.T.: A continuous approach for large-scale constrained quadratic zero-one programming. Optimization 45(3), 1–28 (2001)Google Scholar
  7. 7.
    Le Thi, H.A., Pham, D.T.: The dc (difference of convex functions) programming and dca revisited with dc models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23–46 (2005)Google Scholar
  8. 8.
    Le Thi, H.A., Nguyen, Q.T., Nguyen, H.T., et al.: Solving the earliness tardiness scheduling problem by DC programming and DCA. Math. Balk. 23, 271–288 (2009)Google Scholar
  9. 9.
    Le Thi, H.A., Moeini, M., Pham, D.T.: Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA. Comput. Manag. Sci. 6(4), 459–475 (2009)Google Scholar
  10. 10.
    Le Thi, H.A., Minh, L.H., Pham, D.T., Bouvry, P.: Solving the perceptron problem by deterministic optimization approach based on DC programming and DCA. In: Proceeding in INDIN 2009, Cardiff. IEEE (2009)Google Scholar
  11. 11.
    Le Thi, H.A., Pham, D.T., Huynh, V.N.: Exact penalty and error bounds in dc programming. J. Glob. Optim. 52(3), 509–535 (2012)Google Scholar
  12. 12.
    MacDonald, D.: Discriminative sentence compression with soft syntactic constraints. In: Proceedings of EACL, pp. 297–304 (2006)Google Scholar
  13. 13.
    Niu, Y.S., Pham, D.T.: A DC programming approach for mixed-integer linear programs. In: Modelling, Computation and Optimization in Information Systems and Management Sciences, CCIS, vol. 14, pp. 244–253 (2008)Google Scholar
  14. 14.
    Niu, Y.S.: Programmation DC & DCA en Optimisation Combinatoire et Optimisation Polynomiale via les Techniques de SDP. Ph.D. thesis, INSA, France (2010)Google Scholar
  15. 15.
    Niu, Y.S., Pham, D.T.: Efficient DC programming approaches for mixed-integer quadratic convex programs. In: Proceedings of the International Conference on Industrial Engineering and Systems Management (IESM2011), pp. 222–231 (2011)Google Scholar
  16. 16.
    Niu, Y.S.: On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (2018). arXiv:1803.09900
  17. 17.
    Niu, Y.S.: A parallel branch and bound with DC algorithm for mixed integer optimization. In: The 23rd International Symposium in Mathematical Programming (ISMP2018), Bordeaux, France (2018)Google Scholar
  18. 18.
    Nguyen, H.T., Pham, D.T.: A continuous DC programming approach to the strategic supply chain design problem from qualified partner set. Eur. J. Oper. Res. 183(3), 1001–1012 (2007)Google Scholar
  19. 19.
    NLTK 3.2.5: The Natural Language Toolkit.
  20. 20.
    Pham, D.T., Le Thi, H.A., Pham, V.N., Niu, Y.S.: DC programming approaches for discrete portfolio optimization under concave transaction costs. Optim. Lett. 10(2), 261–282 (2016)Google Scholar
  21. 21.
    Schleich, J., Le Thi, H.A., Bouvry, P.: Solving the minimum m-dominating set problem by a continuous optimization approach based on DC programming and DCA. J. Comb. Optim. 24(4), 397–412 (2012)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.School of Mathematical SciencesShanghai Jiao Tong UniversityShanghaiChina
  2. 2.SJTU-Paristech Elite Institute of TechnologyShanghai Jiao Tong UniversityShanghaiChina

Personalised recommendations