A Difference-of-convex Programming Approach with Parallel Branch-and-bound for Sentence Compression Via a Hybrid Extractive Model
Optimization Letters（2020）
Key words
Sentence compression,Probabilistic model,Parse tree model,DCA,Parallel branch-and-bound
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined