Skip to main content
SpringerLink
Log in

Approximate string matching for music analysis

  • Published:
Soft Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Algorithm Design Group, Department of Computer Science King’s College, Strand, London, WC2R 2LS, UK

    R. Clifford & C. Iliopoulos

Authors
  1. R. Clifford
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Iliopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Clifford.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Clifford, R., Iliopoulos, C. Approximate string matching for music analysis. Soft Computing 8, 597–603 (2004). https://doi.org/10.1007/s00500-004-0384-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-004-0384-5

Keywords

Search

Navigation