mlsanityData to 14 Oct 2026

Can Large Language Models Outperform Non-Experts in Poetry Evaluation? A Comparative Study Using the Consensual Assessment Technique

arXiv 2502.19064 ↗First posted 26 Feb 2025cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

This study adapts the Consensual Assessment Technique (CAT) for Large Language Models (LLMs), introducing a novel methodology for poetry evaluation. Using a 90-poem dataset with a ground truth based on publication venue, we demonstrate that this approach allows LLMs to significantly surpass the performance of non-expert human judges. Our method, which leverages forced-choice ranking within small, randomized batches, enabled Claude-3-Opus to achieve a Spearman's Rank Correlation of 0.87 with the ground truth, dramatically outperforming the best human non-expert evaluation (SRC = 0.38). The LLM assessments also exhibited high inter-rater reliability, underscoring the methodology's robustness. These findings establish that LLMs, when guided by a comparative framework, can be effective and reliable tools for assessing poetry, paving the way for their broader application in other creative domains.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 37 references that are in the map. First posted on arXiv 26 Feb 2025.

Builds on

8 of 37 references.

References · 8

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
  3. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  4. 2019The Curious Case of Neural Text Degenerationcited by 2,916
  5. 2023Art or Artifice? Large Language Models and the False Promise of Creativitycited by 172
  6. 2023BatchEval: Towards Human-like Text Evaluationcited by 17
  7. 2023Bits of Grass: Does GPT already know how to write like Whitman?cited by 13
  8. 2022Crowd Score: A Method for the Evaluation of Jokes using Large Language Model AI Voters as Judgescited by 12

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.