The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A scalable global model for summarization
Open accessAbstract
We present an Integer Linear Program for exact inference under a maximum coverage model for automatic summarization. We compare our model, which operates at the sub-sentence or "concept-level, to a sentence-level model, previously solved with an ILP. Our model scales more efficiently to larger problems because it does not require a quadratic number of variables to address redundancy in pairs of selected sentences. We also show how to include sentence compression in the ILP formulation, which has the desirable property of performing compression and sentence selection simultaneously. The resulting system performs at least as well as the best systems participating in the recent Text Analysis Conference, as judged by a variety of automatic and manual content-based metrics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
(2004) · Cited by 9,718
Reducibility Among Combinatorial Problems
Karp, R. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_8 · Cited by 2,490
Evaluating Content Selection in Summarization: The Pyramid Method
Nenkova, A., & Passonneau, R. (2004) · Columbia University · doi:10.7916/d80r9xvd · Cited by 527
Unsupervised Multilingual Sentence Boundary Detection
Kiss, T., & Strunk, J. (2006) · Computational Linguistics · doi:10.1162/coli.2006.32.4.485 · Cited by 414
Statistics-Based Summarization - Step One: Sentence Compression
Knight, K. K., & Marcu, D. (2000) · Cited by 392
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Clarke, J., & Lapata, M. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2433 · Cited by 303
Gallo, G., Hammer, P. L., & Simeone, B. (1980) · Mathematical Programming Studies · doi:10.1007/bfb0120892 · Cited by 286
The Impact of Frequency on Summarization
Nenkova, A., & Vanderwende, L. (2005) · Cited by 267
Overview of the TAC 2008 update summarization task
Dang, H. T., & Owczarzak, K. (2008) · Cited by 171
Cited by
Fast Abstractive Summarization with Reinforce-Selected Sentence Rewriting
Chen, Y.-C., & Bansal, M. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p18-1063 · Cited by 595
Nenkova, A. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601984715 · Cited by 429
Extractive Summarization as Text Matching
Zhong, M., Liu, P., Chen, Y., Wang, D., Qiu, X., & Huang, X. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.552 · Cited by 413
Neural Document Summarization by Jointly Learning to Score and Select Sentences
Zhou, Q., Yang, N., Wei, F., Huang, S., Zhou, M., & Zhao, T. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p18-1061 · Cited by 344
Graph-based Neural Multi-Document Summarization
Yasunaga, M., Zhang, R., Meelu, K., Pareek, A., Srinivasan, K., & Radev, D. (2017) · Proceedings of the 21st Conference on Computational Natural Language Learning (CoNLL 2017) · doi:10.18653/v1/k17-1045 · Cited by 262
Metadata
- Authors
- Gillick, D., & Favre, B.
- Venue
- Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing - ILP '09
- Published
- 2009
- Pages
- 10-18
- OpenAlex
- W2150869743
- Cited by
- 280
- References
- 18
- FWCI
- 8.46
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A scalable global model for summarization. https://app.cochat.ai/papers/10.3115/1611638.1611640
- The paper
- Gillick, D., & Favre, B. (2009). A scalable global model for summarization. Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing - ILP '09. https://doi.org/10.3115/1611638.1611640
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.