The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
LexRank: Graph-based Lexical Centrality as Salience in Text Summarization
Open accessAbstract
We introduce a stochastic graph-based method for computing relative importance of textual units for Natural Language Processing. We test the technique on the problem of Text Summarization (TS). Extractive TS relies on the concept of sentence salience to identify the most important sentences in a document or set of documents. Salience is typically defined in terms of the presence of particular important words or in terms of similarity to a centroid pseudo-sentence. We consider a new approach, LexRank, for computing sentence importance based on the concept of eigenvector centrality in a graph representation of sentences. In this model, a connectivity matrix based on intra-sentence cosine similarity is used as the adjacency matrix of the graph representation of sentences. Our system, based on LexRank ranked in first place in more than one task in the recent DUC 2004 evaluation. In this paper we present a detailed analysis of our approach and apply it to a larger data set including data from earlier DUC evaluations. We discuss several methods to compute centrality using the similarity graph. The results show that degree-based methods (including LexRank) outperform both centroid-based methods and other systems participating in DUC in most of the cases. Furthermore, the LexRank with threshold method outperforms the other degree-based techniques including continuous LexRank. We also show that our approach is quite insensitive to the noise in the data that may result from an imperfect topical clustering of documents.
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
A STATISTICAL INTERPRETATION OF TERM SPECIFICITY AND ITS APPLICATION IN RETRIEVAL
SPARCK JONES, K. (1972) · Journal of Documentation · doi:10.1108/eb026526 · Cited by 4,505
Unsupervised word sense disambiguation rivaling supervised methods
Yarowsky, D. (1995) · Proceedings of the 33rd annual meeting on Association for Computational Linguistics - · doi:10.3115/981658.981684 · Cited by 2,385
The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries
Carbonell, J., & Goldstein, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130369 · Cited by 2,156
Three generative, lexicalised models for statistical parsing
Collins, M. (1997) · Proceedings of the 35th annual meeting on Association for Computational Linguistics - · doi:10.3115/976909.979620 · Cited by 743
TextRank: Bringing Order into Texts
Mihalcea, R., & Tarau, P. (2004) · University of North Texas Digital Library (University of North Texas) · Cited by 632
Statistics-Based Summarization - Step One: Sentence Compression
Knight, K. K., & Marcu, D. (2000) · Cited by 392
Generating Natural Language Summaries from Multiple On-Line Sources
Radev, D. (1997) · doi:10.7916/d83n2b7j · Cited by 374
Self-citationAutomatic condensation of electronic publications by sentence selection
Brandow, R., Mitze, K., & Rau, L. F. (1995) · Information Processing & Management · doi:10.1016/0306-4573(95)00052-i · Cited by 363
PageRank on semantic networks, with application to word sense disambiguation
Mihalcea, R., Tarau, P., & Figa, E. (2004) · Proceedings of the 20th international conference on Computational Linguistics - COLING '04 · doi:10.3115/1220355.1220517 · Cited by 214
Multi-document Summarization by Graph Search and Matching
Mani, I., & Bloedorn, E. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9712004 · Cited by 200
Experiments in Single and Multi-Document Summarization Using MEAD
Radev, D., Blair-Goldensohn, S., & Zhang, Z. (2001) · Cited by 152
Self-citationRadev, D., Jing, H., & Budzikowska, M. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0005020 · Cited by 135
Self-citationColumbia Multi-Document Summarization: Approach and Evaluation
McKeown, K. R., Hatzivassiloglou, V., Barzilay, R., Schiffman, B., Evans, D., & Teufel, S. (2001) · doi:10.7916/d82v2qhf · Cited by 124
Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence AlignmentPreprint
Barzilay, R., & Lee, L. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0304006 · Cited by 109
Using Hidden Markov Modeling to Decompose Human-Written Summaries
Jing, H. (2002) · Computational Linguistics · doi:10.1162/089120102762671972 · Cited by 90
Cited by
The structure and dynamics of cocitation clusters: A multiple‐perspective cocitation analysis
Chen, C., Ibekwe‐SanJuan, F., & Hou, J. (2010) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21309 · Cited by 1,585
Nallapati, R., Zhai, F., & Zhou, B. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10958 · Cited by 1,233
Jumping NLP Curves: A Review of Natural Language Processing Research [Review Article]
Cambria, E., & White, B. (2014) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2014.2307227 · Cited by 1,102
Sentence similarity based on semantic nets and corpus statistics
Li, Y., McLean, D., Bandar, Z. A., O'Shea, J. D., & Crockett, K. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.130 · Cited by 819
Automatic text summarization: A comprehensive survey
El-Kassas, W. S., Salama, C. R., Rafea, A. A., & Mohamed, H. K. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113679 · Cited by 809
Metadata
- Authors
- Erkan, G., & Radev, D. R.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2004-12-01
- Volume
- 22
- Pages
- 457-479
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2110693578
- Cited by
- 1,700
- References
- 16
- FWCI
- 9.49
- Type
- journal article
- Language
- en
- Open access
- diamond
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
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.