arXiv:2610.38545 · v1

TSM diff: A new Parallel-Tree-Traversal Algorithm for the Comparison of Music Score Files

首次提交 2026-10-28 17:45

版本更新 2026-10-28 17:45

雷达观测 2026-10-30 10:22

摘要

Music score files are more difficult to compare than their text-based equivalents, as their content is more complex and organised into hierarchical structures. This explains the lack of tools for processing music scores similar to the widely used old Unix diff command. We propose a new algorithm and tool for comparing digital music scores in various encodings, such as MusicXML or MEI, based on a graph-structured abstract representation called Tree Score Model (TSM). Given two scores, after conversion into TSM, our procedure calculates jointly: A list of differences, localised by time positions in the input scores; A time distance, cumulated duration of time-spans where scores differ; An edit distance, called surface distance, based on notational attributes not related to time. The two later measures are normalised and combined into a similarity distance between scores. Our procedure has been implemented in C++ and is available as a Python module. Our first experiments have shown a very good efficiency even on challenging data. As a proof of concept, we propose two demos based on different versions of some Mozart's piano sonata, and transcriptions of monophonic soli on the same jazz standards by different performers. https://tsm-diff-lbd-7a7e2a.gitlab.io/demo.html

期刊信息：27th Conference of the International Society for Music Information Retrieval LBD, Nov 2026, Abu DHABI, United Arab Emirates