Pith. sign in

REVIEW 1 cited by

Acrostic Poem Generation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.02239 v1 pith:N5UII7ON submitted 2020-10-05 cs.CL

classification cs.CL
keywords poemsacrosticmodelpoemtaskgenerationshouldword
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a new task in the area of computational creativity: acrostic poem generation in English. Acrostic poems are poems that contain a hidden message; typically, the first letter of each line spells out a word or short phrase. We define the task as a generation task with multiple constraints: given an input word, 1) the initial letters of each line should spell out the provided word, 2) the poem's semantics should also relate to it, and 3) the poem should conform to a rhyming scheme. We further provide a baseline model for the task, which consists of a conditional neural language model in combination with a neural rhyming model. Since no dedicated datasets for acrostic poem generation exist, we create training data for our task by first training a separate topic prediction model on a small set of topic-annotated poems and then predicting topics for additional poems. Our experiments show that the acrostic poems generated by our baseline are received well by humans and do not lose much quality due to the additional constraints. Last, we confirm that poems generated by our model are indeed closely related to the provided prompts, and that pretraining on Wikipedia can boost performance.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ReFF: Reinforcing Format Faithfulness in Language Models across Varied Tasks

    cs.CL 2024-12 conditional novelty 6.0 of 10

    FormatBench evaluates LLM format adherence across ten tasks, and REFF uses format-checker rewards in PPO to raise format faithfulness substantially while keeping content quality roughly stable.

Pith tools