PE-MSC: partial entailment-based minimum set cover for text summarization.
Anand GuptaManpreet KaurSonaali MittalSwati GargPublished in: Knowl. Inf. Syst. (2021)
Keyphrases
- text summarization
- set cover
- greedy algorithm
- approximation algorithms
- named entity recognition
- np hard
- network flow
- natural language processing
- greedy heuristics
- information extraction
- minimum cost
- question answering
- multi document summarization
- text segments
- greedy heuristic
- solution space
- convex hull
- automatic text summarization
- query expansion
- automatic summarization
- maximum entropy
- named entities
- worst case
- expert systems
- knowledge base
- primal dual
- linear programming
- higher order