The DOI matches its Crossref record.
Efficiently Computed Lexical Chains as an Intermediate Representation for Automatic Text Summarization
Abstract
While automatic text summarization is an area that has received a great deal of attention in recent research, the problem of efficiency in this task has not been frequently addressed. When the size and quantity of documents available on the Internet and from other sources are considered, the need for a highly efficient tool that produces usable summaries is clear. We present a linear-time algorithm for lexical chain computation. The algorithm makes lexical chains a computationally feasible candidate as an intermediate representation for automatic text summarization. A method for evaluating lexical chains as an intermediate step in summarization is also presented and carried out. Such an evaluation was heretofore not possible because of the computational complexity of previous lexical chains algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Aggarwal, C. C. (2015) · Data Mining · doi:10.1007/978-3-319-14142-8_13 · Cited by 606
A Survey of Text Summarization Techniques
Nenkova, A., & McKeown, K. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_3 · Cited by 590
Introduction to the Special Issue on Summarization
Radev, D. R., Hovy, E., & McKeown, K. (2002) · Computational Linguistics · doi:10.1162/089120102762671927 · Cited by 539
Nenkova, A. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601984715 · Cited by 429
Sentence Fusion for Multidocument News Summarization
Barzilay, R., & McKeown, K. R. (2005) · Computational Linguistics · doi:10.1162/089120105774321091 · Cited by 429
Metadata
- Authors
- Silber, H. G., & McCoy, K. F.
- Venue
- Computational Linguistics
- Publisher
- MIT Press - Journals
- Published
- 2002-12
- Volume
- 28
- Issue
- 4
- Pages
- 487-496
- ISSN
- 0891-2017 (ISSN-L)
- 1530-9312
- OpenAlex
- W2065841724
- Cited by
- 205
- References
- 0
- FWCI
- 8.36
- Type
- journal article
- Language
- en
- Open access
- closed
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: Efficiently Computed Lexical Chains as an Intermediate Representation for Automatic Text Summarization. https://app.cochat.ai/papers/10.1162/089120102762671954
- The paper
- Silber, H. G., & McCoy, K. F. (2002). Efficiently Computed Lexical Chains as an Intermediate Representation for Automatic Text Summarization. Computational Linguistics. https://doi.org/10.1162/089120102762671954
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.