Saved in:
| Main Authors: | , , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.01701 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910395792359424 |
|---|---|
| author | Nawrath, Marcel Nowak, Agnieszka Ratz, Tristan Walenta, Danilo C. Opitz, Juri Ribeiro, Leonardo F. R. Sedoc, João Deutsch, Daniel Mille, Simon Liu, Yixin Zhang, Lining Gehrmann, Sebastian Mahamood, Saad Clinciu, Miruna Chandu, Khyathi Hou, Yufang |
| author_facet | Nawrath, Marcel Nowak, Agnieszka Ratz, Tristan Walenta, Danilo C. Opitz, Juri Ribeiro, Leonardo F. R. Sedoc, João Deutsch, Daniel Mille, Simon Liu, Yixin Zhang, Lining Gehrmann, Sebastian Mahamood, Saad Clinciu, Miruna Chandu, Khyathi Hou, Yufang |
| contents | At the heart of the Pyramid evaluation method for text summarization lie human written summary content units (SCUs). These SCUs are concise sentences that decompose a summary into small facts. Such SCUs can be used to judge the quality of a candidate summary, possibly partially automated via natural language inference (NLI) systems. Interestingly, with the aim to fully automate the Pyramid evaluation, Zhang and Bansal (2021) show that SCUs can be approximated by automatically generated semantic role triplets (STUs). However, several questions currently lack answers, in particular: i) Are there other ways of approximating SCUs that can offer advantages? ii) Under which conditions are SCUs (or their approximations) offering the most value? In this work, we examine two novel strategies to approximate SCUs: generating SCU approximations from AMR meaning representations (SMUs) and from large language models (SGUs), respectively. We find that while STUs and SMUs are competitive, the best approximation quality is achieved by SGUs. We also show through a simple sentence-decomposition baseline (SSUs) that SCUs (and their approximations) offer the most value when ranking short summaries, but may not help as much when ranking systems or longer summaries. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_01701 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Role of Summary Content Units in Text Summarization Evaluation Nawrath, Marcel Nowak, Agnieszka Ratz, Tristan Walenta, Danilo C. Opitz, Juri Ribeiro, Leonardo F. R. Sedoc, João Deutsch, Daniel Mille, Simon Liu, Yixin Zhang, Lining Gehrmann, Sebastian Mahamood, Saad Clinciu, Miruna Chandu, Khyathi Hou, Yufang Computation and Language At the heart of the Pyramid evaluation method for text summarization lie human written summary content units (SCUs). These SCUs are concise sentences that decompose a summary into small facts. Such SCUs can be used to judge the quality of a candidate summary, possibly partially automated via natural language inference (NLI) systems. Interestingly, with the aim to fully automate the Pyramid evaluation, Zhang and Bansal (2021) show that SCUs can be approximated by automatically generated semantic role triplets (STUs). However, several questions currently lack answers, in particular: i) Are there other ways of approximating SCUs that can offer advantages? ii) Under which conditions are SCUs (or their approximations) offering the most value? In this work, we examine two novel strategies to approximate SCUs: generating SCU approximations from AMR meaning representations (SMUs) and from large language models (SGUs), respectively. We find that while STUs and SMUs are competitive, the best approximation quality is achieved by SGUs. We also show through a simple sentence-decomposition baseline (SSUs) that SCUs (and their approximations) offer the most value when ranking short summaries, but may not help as much when ranking systems or longer summaries. |
| title | On the Role of Summary Content Units in Text Summarization Evaluation |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2404.01701 |