Toward a General Framework for Polyphonic Comparison

  • Authors:

  • Julien Allali;Pascal Ferraro;Pierre Hanna;Costas Iliopoulos;Matthias Robine

  • Affiliations:

  • LaBRI - Université de Bordeaux 1 F-33405 Talence cedex, France. E-mail: {julien.allali,pierre.hanna,matthias.robine}@labri.fr;Pacific Institute For the Mathematical Sciences, University of Calgary, Canada. E-mail: pascal.ferraro@labri.fr;LaBRI - Université de Bordeaux 1 F-33405 Talence cedex, France. E-mail: {julien.allali,pierre.hanna,matthias.robine}@labri.fr;King's College - London, England. E-mail: costas.iliopoulos@kings.uk;LaBRI - Université de Bordeaux 1 F-33405 Talence cedex, France. E-mail: {julien.allali,pierre.hanna,matthias.robine}@labri.fr

  • Venue:
  • Fundamenta Informaticae - Special Issue on Stringology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Existing symbolic music comparison systems generally consider monophonic music or monophonic reduction of polyphonic music. Adaptation of alignment algorithms to music leads to accurate systems, but their extensions to polyphonic music raise new problems. Indeed, a chord may match several consecutive notes, or the difference between two similar motifs may be a few swapped notes. Moreover, the substitution scores between chords are difficult to set up. In this paper, we propose a general framework for polyphonic music using the substitution score scheme set for monophonic music, which allows new operations by extending the operations proposed by Mongeau and Sankoff [15]. From a practical point of view, the limitation of chord sizes and the number of notes that can be merged consecutively lead to a complexity that remains quadratic.