Skip to main content

Satisfying Poetry Properties Using Constraint Handling Rules

  • Conference paper
Computational Linguistics and Intelligent Text Processing (CICLing 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9042))

  • 3324 Accesses

Abstract

Poetry is one of the most interesting and complex natural language generation (NLG) systems because a text needs to simultaneously satisfy three properties to be considered a poem; namely grammaticality (grammatical structure and syntax), poeticness (poetic structure) and meaningfulness (semantic content). In this paper we show how the declarative approach enabled by the high-level constraint programming language Constraint Handling Rules (CHR) can be applied to satisfy the three properties while generating poems. The developed automatic poetry generation system generates a poem by incrementally selecting its words through a step-wise pruning of a customised lexicon according to the grammaticality, poeticness and meaningfulness constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Manurung, H.: An evolutionary algorithm approach to poetry generation (2004)

    Google Scholar 

  2. Sneyers, J., De Schreye, D.: Apopcaleaps: Automatic music generation with chrism. In: 11th International Society for Music Information Retrieval Conference, ISMIR 2010, Utrecht, The Netherlands (August 2010) (Submitted)

    Google Scholar 

  3. Frühwirth, T.: Theory and practice of constraint handling rules. The Journal of Logic Programming 37(1-3), 95–138 (1998)

    Article  MATH  Google Scholar 

  4. Oliveira, H.: Automatic generation of poetry: an overview. Universidade de Coimbra (2009)

    Google Scholar 

  5. Manurung, R., Ritchie, G., Thompson, H.: Using genetic algorithms to create meaningful poetic text. J. Exp. Theor. Artif. Intell. 24(1), 43–64 (2012)

    Article  Google Scholar 

  6. Levy, R.P.: A computational model of poetic creativity with neural network as measure of adaptive fitness. In: Proceedings of the ICCBR 2001 Workshop on Creative Systems. Citeseer (2001)

    Google Scholar 

  7. Gervás, P.: Computational modelling of poetry generation. In: Artificial Intelligence and Poetry Symposium, AISB Convention 2013. University of Exeter, United Kingdom (2013)

    Google Scholar 

  8. Díaz-Agudo, B., Gervás, P., González-Calero, P.A., Craw, S., Preece, A.: Poetry generation in colibri. In: Proceedings of the 6th European Conference on Case Based Reasoning, Aberdeen, Scotland (2002)

    Google Scholar 

  9. Toivanen, J., et al.: Corpus-based generation of content and form in poetry. In: Proceedings of the Third International Conference on Computational Creativity (2012)

    Google Scholar 

  10. Toivanen, J.M., Järvisalo, M., Toivonen, H.: Harnessing constraint programming for poetry composition. In: Proceedings of the Fourth International Conference on Computational Creativity, p. 160 (2013)

    Google Scholar 

  11. Bolock, A.E., Abdennadher, S.: Towards automatic poetry generation using constraint handling rules. In: Proceedings of the 30th ACM Symposium on Applied Computing (2015)

    Google Scholar 

  12. Princeton, U.: About wordnet (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alia El Bolock .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

El Bolock, A., Abdennadher, S. (2015). Satisfying Poetry Properties Using Constraint Handling Rules. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2015. Lecture Notes in Computer Science(), vol 9042. Springer, Cham. https://doi.org/10.1007/978-3-319-18117-2_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18117-2_25

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18116-5

  • Online ISBN: 978-3-319-18117-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics