Evidence map›Paper›PMID 38770277›Full record

ArticleProceedings of the conference. Association for Computational Linguistics. Meeting2023

Generating EDU Extracts for Plan-Guided Summary Re-Ranking.

Griffin Adams, Alexander R Fabbri, Faisal Ladhak, Kathleen McKeown, Noémie Elhadad

Abstract read
In one paragraph

Article in Proceedings of the conference. Association for Computational Linguistics. Meeting, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. From Sparse to Dense: GPT-4 Summarization with Chain of Density Prompting.Proceedings of the Conference on Empirical Methods in Natural Language Processing. Conference on Empirical Methods in Natural Language Processing · 2023
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Griffin AdamsColumbia University: Computer Science.
Alexander R FabbriSalesforce Research.
Faisal LadhakColumbia University: Computer Science.
Kathleen McKeownColumbia University: Computer Science.
Noémie ElhadadColumbia University: Computer Science.

Funding

Training in Biomedical Informatics at Columbia UniversityT15LM007079 · NLM · COLUMBIA UNIV NEW YORK MORNINGSIDE · PI NOEMIE ELHADAD, GEORGE M HRIPCSAK · 1992 to 2026
$28.9M
NLM NIH HHS T15 LM007079
6 · The paper itself

Abstract

Two-step approaches, in which summary candidates are generated-then-reranked to return a single summary, can improve ROUGE scores over the standard single-step approach. Yet, standard decoding methods (i.e., beam search, nucleus sampling, and diverse beam search) produce candidates with redundant, and often low quality, content. In this paper, we design a novel method to generate candidates for re-ranking that addresses these issues. We ground each candidate abstract on its own unique content plan and generate distinct plan-guided abstracts using a model's top beam. More concretely, a standard language model (a BART LM) auto-regressively generates elemental discourse unit (EDU) content plans with an extractive copy mechanism. The top

Identifiers

PMID38770277
PMCPMC11105404

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.