Skip to Main content Skip to Navigation
Conference papers

Fragmentations with pitch, rhythm and parallelism constraints for variation matching

Abstract : Composers commonly employ ornamentation and elaboration techniques to generate varied versions of an initial core melodic idea. Dynamic programming techniques, based on edit operations, are used to find similarities between melodic strings. However, replacements, insertions and deletion may give non-musically pertinent similarities, especially if rhythmic or metrical structure is not considered. We propose, herein, to compute the similarity between a reduced query and a melody employing only fragmentation operations. Such fragmentations transform one note from the reduced query into a possible large set of notes, taking into account metrical, pitch and rhythm constraints, as well as elementary parallelism information. We test the proposed algorithm on two prototypical ''theme and variations'' piano pieces by W. A. Mozart and show that the proposed constrained fragmentation operations are capable of detecting variations with high sensitivity and specificity.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Mathieu Giraud Connect in order to contact the contributor
Submitted on : Wednesday, January 21, 2015 - 2:03:03 PM
Last modification on : Tuesday, January 12, 2021 - 2:40:08 PM
Long-term archiving on: : Wednesday, April 22, 2015 - 10:41:31 AM


Files produced by the author(s)




Mathieu Giraud, Ken Déguernel, Emilios Cambouropoulos. Fragmentations with pitch, rhythm and parallelism constraints for variation matching. International Symposium on Computer Music Multidisciplinary Research (CMMR), Oct 2013, Marseille, France. pp.298-312, ⟨10.1007/978-3-319-12976-1_19⟩. ⟨hal-00906462v2⟩



Record views


Files downloads