Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | English |
| Published: |
Zenodo
2026
|
| Online Access: | https://doi.org/10.5281/zenodo.20021540 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866901760622198784 |
|---|---|
| author | *1G. Krishnaveni, 2B. Sarushma, 3L. Samuel Raju, 4A. Rakesh, 5B. Sai Pavan |
| author_facet | *1G. Krishnaveni, 2B. Sarushma, 3L. Samuel Raju, 4A. Rakesh, 5B. Sai Pavan |
| contents | <p>The massive increase in digital text has created a huge need for effective, automated summarization systems. Manually summarizing large documents takes significant time and is often not practical. Recent improvements in transformer neural language models have helped with abstractive summarization significantly. In this research, we assess the relative performance of three neural language models for automatic text summarization, specifically BART, T5, and GPT, using the same conditions for each model (compression ratio for conciseness and ROUGE metrics for summary quality). We propose a combined performance metric to compare this trade-off of length versus informativeness. Our experimental results demonstrate encoder-decoder architectures outperform autoregressive architectures in automatic summarization tasks. BART produced the highest quality summaries among all three models evaluated. Our study proposes an evaluation framework and methods for model selection to assist in the efficient development of practical summarization systems.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_20021540 |
| institution | Zenodo |
| language | eng |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | PERFORMANCE ANALYSIS OF NEURAL LANGUAGE MODELS FOR AUTOMATED TEXT SUMMARIZATION *1G. Krishnaveni, 2B. Sarushma, 3L. Samuel Raju, 4A. Rakesh, 5B. Sai Pavan <p>The massive increase in digital text has created a huge need for effective, automated summarization systems. Manually summarizing large documents takes significant time and is often not practical. Recent improvements in transformer neural language models have helped with abstractive summarization significantly. In this research, we assess the relative performance of three neural language models for automatic text summarization, specifically BART, T5, and GPT, using the same conditions for each model (compression ratio for conciseness and ROUGE metrics for summary quality). We propose a combined performance metric to compare this trade-off of length versus informativeness. Our experimental results demonstrate encoder-decoder architectures outperform autoregressive architectures in automatic summarization tasks. BART produced the highest quality summaries among all three models evaluated. Our study proposes an evaluation framework and methods for model selection to assist in the efficient development of practical summarization systems.</p> |
| title | PERFORMANCE ANALYSIS OF NEURAL LANGUAGE MODELS FOR AUTOMATED TEXT SUMMARIZATION |
| url | https://doi.org/10.5281/zenodo.20021540 |