Poetic RNA: Adapting RNA Design Methods to the Analysis of Poetry

  • Veronica Dahl
  • M. Dolores Jiménez-López
  • Olivier Perriquet
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 71)


The style in which a Ribonucleic Acid (RNA) molecule folds in space obeys laws of nucleotide binding and attraction which are encoded in its primary structure, that is, in the sequence of nucleotides conforming it. Natural language sentences can also be viewed as encodings for a structure in space -a parse tree- which exhibits relationships or bindings between its parts. We explore the possibilities in adapting a recent and simple methodology for bioinformatics -which has been successfully used for RNA design- to the problem of parsing poems that follow specific stylistic trends. The methodology introduced in this paper can be expressed in terms of a multi-agent system that includes two types of agents: linguistic agents and probabilistic agents.


Noun Phrase Direct Object Parse Tree Mathematical Linguistics Word Boundary 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baldi, P.: Bioinformatics: the machine learning approach. MIT Press, Cambridge (1998)Google Scholar
  2. 2.
    Bavarian, M., Dahl, V.: Constraint-Based Methods for Biological Sequence Analysis. Journal of Universal Computing Science 12(11), 1500–1520 (2006)Google Scholar
  3. 3.
    Bel-Enguix, G., Dahl, V., Jiménez-López, M.D.: DNA and Natural Languages: Text Mining. In: Fred, A. (ed.) Proceedings of the International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, pp. 140–145. INSTICC, Madeira (2009)Google Scholar
  4. 4.
    Christiansen, H.: CHR as Grammar Formalism, a First Report. In: Apt, K.R., et al. (eds.) Sixth Annual Workshop of the ERCIM Working Group on Constraints, Prague (2001)Google Scholar
  5. 5.
    Dahl, V., Maharshak, E.: DNA Replication as a Model for Computational Linguistics. In: Mira, J., Ferrández, J.M., Álvarez, J.R., de la Paz, F., Toledo, F.J., et al. (eds.) IWINAC 2009. LNCS, vol. 5601, pp. 346–355. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Fruhwirth, T.: Theory and Practice of Constraint Handling Rules. Journal of Logic Programming 37(1-3), 95–138 (1998)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Guillen, N.: Motivos de son (1930); Biblioteca Virtual Miguel de Cervantes, Alicante (2001)Google Scholar
  8. 8.
    Logan, H.M.: Computer Analysis of Sound and Meter in Poetry. College Literature 15(1), 19–24 (1988)Google Scholar
  9. 9.
    Mendelowitz, E.: Drafting poems: inverted potentialities. In: International Multimedia Conference, Proceedings of the 14th Annual ACM International Conference on Multimedia, Santa Barbara, pp. 1047–1048 (2006)Google Scholar
  10. 10.
    Searls, D.B.: The computational linguistics of biological sequences. In: Artificial intelligence and molecular biology. American Association for Artificial Intelligence, pp. 47–120 (1993)Google Scholar
  11. 11.
    Seaman, W.: Recombinant Poetics: Emergent Meaning as Examined and Explored Within a Specific Generative Virtual Environment. Ph.D. Thesis, CAiiA (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Veronica Dahl
    • 1
    • 2
  • M. Dolores Jiménez-López
    • 2
  • Olivier Perriquet
    • 3
  1. 1.Department of Computing ScienceSimon Fraser UniversityBurnabyCanada
  2. 2.Research Group on Mathematical LinguisticsUniversitat Rovira i VirgiliTarragonaSpain
  3. 3.Centre for Artificial IntelligenceNew University of LisbonCaparicaPortugal

Personalised recommendations