Abdibayev, Almas ; Igarashi, Yohei ; Riddell, Allen ; Rockmore, Daniel (2023)
Limericks and Computational Poetics: The Minimal Pairs Framework. Computational Challenges for Poetic Analysis and Synthesis.
In: Journal of Computational Literary Studies, 2022, 1 (1)
doi: 10.26083/tuprints-00023258
Article, Secondary publication, Publisher's Version
Text
jcls-117-abdibayev.pdf Copyright Information: CC BY 4.0 International - Creative Commons, Attribution. Download (5MB) |
|
Text
jcls-117-abdibayev.xml Copyright Information: CC BY 4.0 International - Creative Commons, Attribution. Download (118kB) |
Item Type: | Article |
---|---|
Type of entry: | Secondary publication |
Title: | Limericks and Computational Poetics: The Minimal Pairs Framework. Computational Challenges for Poetic Analysis and Synthesis |
Language: | English |
Date: | 21 February 2023 |
Place of Publication: | Darmstadt |
Year of primary publication: | 2022 |
Journal or Publication Title: | Journal of Computational Literary Studies |
Volume of the journal: | 1 |
Issue Number: | 1 |
Collation: | 26 Seiten |
DOI: | 10.26083/tuprints-00023258 |
Corresponding Links: | |
Origin: | Secondary publication from TUjournals |
Abstract: | Computational poetics encompasses the wide range of challenges implicit in analyzing and generating poetry – in all of its many forms – through computational techniques and frameworks. In this paper, we build on a nascent body of work that has proposed the use of the limerick as a ‘model organism’ for computational poetics, and in particular the use of Benchmarked Poetic Minimal Pairs (BPoMP) as an investigative framework, especially for the evaluation of the poetic abilities of deep learning language models. To that end, we include results for two new BPoMP tasks of interest for limerick analysis – the word deletion task and the limerick completion tasks. We include a release of a data set for the deletion task. We also offer up a suite of an additional ten BPoMP challenges whose precise formulations still require detail. |
Uncontrolled Keywords: | limericks, computational poetics, minimal pairs, evaluation, language models |
Status: | Publisher's Version |
URN: | urn:nbn:de:tuda-tuprints-232589 |
Additional Information: | Urspr. Konferenzveröffentlichung/Originally conference publication: 1st Annual Conference of Computational Literary Studies, 01.-02.06.2022, Darmstadt, Germany |
Classification DDC: | 800 Literature > 800 Literature, rhetoric and criticism |
Divisions: | 02 Department of History and Social Science > Institut für Sprach- und Literaturwissenschaft > Digital Philology – Modern German Literary Studies |
Date Deposited: | 21 Feb 2023 10:25 |
Last Modified: | 22 Jul 2024 08:09 |
URI: | https://tuprints.ulb.tu-darmstadt.de/id/eprint/23258 |
PPN: | |
Export: |
View Item |