Melodic String Matching via Interval Consolidation and Fragmentation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Melodic String Matching via Interval Consolidation and Fragmentation

Résumé

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.
Fichier principal
Vignette du fichier
978-3-642-33412-2_47_Chapter.pdf (311.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01523088 , version 1 (16-05-2017)

Licence

Paternité

Identifiants

Citer

Carl Barton, Emilios Cambouropoulos, Costas S. 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⟩
257 Consultations
75 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More