Approximate string matching for music analysis

Authors:
R. Clifford;C. Iliopoulos
Affiliations:
Department of Computer Science King’s College, Algorithm Design Group, Strand, WC2R 2LS, London, UK;Department of Computer Science King’s College, Algorithm Design Group, Strand, WC2R 2LS, London, UK
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2004

Citing 0
Cited 6

All maximal-pairs in step-leap representation of melodic sequence

Information Sciences: an International Journal
A Black Box for Online Approximate Pattern Matching

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Computational geometric aspects of rhythm, melody, and voice-leading

Computational Geometry: Theory and Applications
A black box for online approximate pattern matching

Information and Computation
Necklace swap problem for rhythmic similarity measures

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Self-normalised distance with don't cares

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

Approximate pattern matching algorithms have become an important tool in computer assisted music analysis and information retrieval. The number of different problem formulations has greatly expanded in recent years, not least because of the subjective nature of measuring musical similarity. From an algorithmic perspective, the complexity of each problem depends crucially on the exact definition of the difference between two strings. We present an overview of advances in approximate string matching in this field focusing on new measures of approximation.