Skip to Main content Skip to Navigation
Conference papers

Melodic String Matching via Interval Consolidation and Fragmentation

Abstract : In this paper, we address the problem of melodic string matching that enables identification of varied (ornamented) instances of a given melodic pattern. To this aim, a new set of edit distance operations adequate for pitch interval strings is introduced. Insertion, deletion and replacement operations are abolished as irrelevant. Consolidation and fragmentation are retained, but adapted to the pitch interval domain, i.e., two or more intervals of one string may be matched to an interval from a second string through consolidation or fragmentation. The melodic interval string matching problem consists of finding all occurrences of a given pattern in a melodic sequence that takes into account exact matches, consolidations and fragmentations of intervals in both the sequence and the pattern. We show some properties of the problem and an algorithm that solves this problem is proposed.
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Tuesday, May 16, 2017 - 9:17:26 AM
Last modification on : Thursday, March 5, 2020 - 5:41:48 PM
Long-term archiving on: : Friday, August 18, 2017 - 12:49:59 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Carl Barton, Emilios Cambouropoulos, Costas Iliopoulos, Zsuzsanna Lipták. Melodic String Matching via Interval Consolidation and Fragmentation. 8th International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2012, Halkidiki, Greece. pp.460-469, ⟨10.1007/978-3-642-33412-2_47⟩. ⟨hal-01523088⟩



Record views


Files downloads