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
Changed an Item |
Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NLTK / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: StanfordCoreNLP / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3005140901 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2002.01352 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:48, 19 April 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
