A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model (Q2230777): Difference between revisions
From MaRDI portal
Latest revision as of 17:56, 26 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model |
scientific article |
Statements
A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model (English)
0 references
28 September 2021
0 references
sentence compression
0 references
probabilistic model
0 references
parse tree model
0 references
DCA
0 references
parallel branch-and-bound
0 references
0 references
0 references
0 references
