Automatic composition of music by means of grammatical evolution

ABSTRACT

This work describes how grammatical evolution may be applied to the domain of automatic composition. Our goal is to test this technique as an alternate tool for automatic composition. The AP440 auxiliary processor will be used to play music, thus we shall use a grammar that generates AP440 melodies. Grammar evolution will use fitness functions defined from several well-known single melodies to automatically generate AP440 compositions that are expected to sound like those composed by human musicians.

REFERENCES

• 1: J. McCormack, 1996 Grammar-based music composition. In Complex International Vol 3
• 2: J. Biles, 1994 GenJam: A Genetic Algorithm for Generating Jazz Solos. In Proceedings of the 1994 International Computer Music Conference, ICMA, San Francisco, 1994
• 3: E. Bilotta, P. Pantano, V. Talarico, 2000 Synthetic Harmonies: an approach to musical semiosis by means of cellular automata. In Artificial Life VII: Proceedings of the Seventh International Conference, edited by M. Beday et al. MIT Press.
• 4: D. Lidov, J. Gabura, 1973 A melody writing algorithm using a formal language model, in Computer Studies in the Humanities 4(3-4), pp. 138-148, 1973
• 5: P. Laine, M. Kuuskankare, 1994 Genetic Algorithms in Musical Style oriented Generation in: Proceedings of the First IEEE Conference on Evolutionary Computation, Orlando, Florida, 1994.
• 6: D. Horowitz, 1994 Generating Rhythms with Genetic Algorithms, in: Proceedings of the ICMC 1994, International Computer Music Association, Århus, 1994
• 7: B. Jacob, 1994 Composing with Genetic Algorithms In Proceedings of the 1995 International Computer Music Conference, ICMA, San Francisco.
• 8: N. Chomsky, 1956 Three models for the description of a language IRE Transaction on Information Theory. 2:3 113-124.
• 9: John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 10: M. O'Neill and C. Ryan:Grammatical Evolution. IEEE Transaction on Evolutionary Computation. August 2001. Vol. 5, number 4 ITEVF5 (ISSN 1089-779X)
• 11: Michael O'Neill , Conor Ryan, Evolving Multi-line Compilable C Programs, Proceedings of the Second European Workshop on Genetic Programming, p.83-92, May 26-27, 1999
• 12: M. O'Neill and C. Ryan:Under the Hood of Grammatical Evolution. In GECCO '99: Proceedings of the Genetic and Evolutionary Computation Conference 1999, W. Banzhaf et al. Eds. San Mateo, CA: Morgan Kaufmann, 1999, vol. 2, pp. 1143-1148
• 13: Michael O'Neill , Conor Ryan, Genetic Code Degeneracy: Implications for Grammatical, Proceedings of the 5th European Conference on Advances in Artificial Life, p.149-153, September 13-17, 1999
• 14: Conor Ryan , J. J. Collins , Michael O'Neill, Grammatical Evolution: Evolving Programs for an Arbitrary Language, Proceedings of the First European Workshop on Genetic Programming, p.83-96, April 14-15, 1998
• 15: Ryan,O'Neill M. Grammatical Evolution: A Steady State Approach. In Late Breaking Papers, Genetic Programming 1998, pages 180-185.
• 16: Ryan, M. O'Neill:Grammatical Evolution: A Steady State Approach. In Genetic Programming 1998: Proceedings of the 3rd Annual Conference, J. R. Koza et al. Ed.s Cambridge, MMA, 1998, pp. 180-185
• 17: C. Ryan, M. O'Neill,and J. J. Collins:Grammatical Evolution: Solving Trigonometric Identities. In Mendel'98: Proceedings of the 4th International Conference on Genetic Algorithms, Optimization Problems, Fuzzy Logic, Neural Networks, and Rough Sets. Brno, Czech Republic: Tech. Univ. Brno, 1998, pp. 111-119
• 18: IBM: APL2 for the IBM PC: Reference summary Version 1.02. IBM Scientific Centres Madrid, Spain and Winchester, England. SC33-0601-01. Nov. 8, 1991.
• 19: Zbigniew Michalewicz , David B. Fogel, How to solve it: modern heuristics, Springer-Verlag New York, Inc., New York, NY, 2000
• 20: M. Moncur:The www virtual keyboard, http://www.xmission.com/~mgm/misc/keyboard.html