A Flexible Encoding Model for Non-Unique Note Alignments
Pith reviewed 2026-06-29 02:38 UTC · model grok-4.3
The pith
A minimal backward-compatible extension to the Match file format supports non-unique alignments between performance and score notes.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper claims that virtual score notes and virtual performance notes, together with an extended section annotation, form a minimal addition to the Match file format that can represent multiple links between performance and score notes without breaking existing parsers or requiring new syntax.
What carries the argument
Virtual pointer notes that stand in for multiple score or performance events and thereby allow many-to-many alignments.
If this is right
- Practice repetitions can be encoded by linking one score note to several performance notes without duplication.
- Improvised realizations become representable by allowing one performance note to point to multiple possible score locations.
- Performance regions can carry extra semantic labels that go beyond simple score repetitions.
- Files remain readable by all prior Match parsers because the additions are optional and use existing line structures.
Where Pith is reading between the lines
- The same virtual-note pattern could be adapted to other symbolic alignment formats that currently enforce unique mappings.
- Analysis tools for rehearsal data or continuo improvisation would gain direct access to the multiple-link information.
- Large collections of annotated rehearsal recordings could be created without forcing artificial one-to-one simplifications.
Load-bearing premise
Adding these virtual notes and widening the section line will be enough to cover all required non-unique cases without creating parsing ambiguity.
What would settle it
An alignment example that cannot be written unambiguously with the new virtual notes, or an existing Match parser that rejects a file containing them, would show the extension is insufficient.
read the original abstract
Symbolic music alignment links notes in a symbolic performance to their counterparts in a score. While existing alignment encoding formats provide unique correspondences between these notes, there are various musical practices and forms such as practice repetitions in rehearsal and improvised realizations in basso continuo that require a more flexible approach to encoding their alignments. In this paper, we propose a minimal, backward-compatible extension to the Match file format to support such non-unique and semantically complex alignments. We introduce two virtual pointer notes - virtual score notes and virtual performance notes - which allow to encode multiple links between performance and score notes. In addition we expand the Match file's 'section' line to include semantically meaningful annotations of performance regions beyond score-indicated musical repetitions. We further demonstrate the utility of these extensions through two representative use-cases in piano rehearsal and basso continuo.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a minimal, backward-compatible extension to the Match file format to encode non-unique and semantically complex note alignments (e.g., practice repetitions, basso continuo improvisations). It introduces virtual score notes and virtual performance notes as pointer mechanisms for multiple links, expands the 'section' line for performance-region annotations, and illustrates the approach via two use-cases in piano rehearsal and basso continuo.
Significance. If the extension can be shown to preserve parser compatibility while correctly capturing non-unique alignments, it would fill a documented gap in symbolic music alignment formats and support downstream tasks in music information retrieval that currently lack representations for rehearsal and improvisatory practices.
major comments (2)
- [Abstract] Abstract: the central claim that the extension is 'minimal, backward-compatible' rests on the untested assumption that virtual pointer notes plus expanded section lines will not introduce parsing ambiguity or break existing Match parsers; no formal grammar update, concrete example .match files, or parser-interaction analysis is supplied to substantiate this.
- [Use-cases] Use-case demonstrations: the two representative scenarios are described at the design level only; the manuscript supplies neither sample encoded files nor any validation (e.g., round-trip parsing tests or alignment-error metrics) that would confirm the new constructs function as intended.
minor comments (1)
- Notation for the new virtual notes should be defined with explicit syntax examples (e.g., line formats) rather than descriptive prose alone.
Simulated Author's Rebuttal
We thank the referee for their constructive comments, which highlight important areas for strengthening the presentation of our proposed Match file format extension. We address each major comment below.
read point-by-point responses
-
Referee: [Abstract] Abstract: the central claim that the extension is 'minimal, backward-compatible' rests on the untested assumption that virtual pointer notes plus expanded section lines will not introduce parsing ambiguity or break existing Match parsers; no formal grammar update, concrete example .match files, or parser-interaction analysis is supplied to substantiate this.
Authors: We agree that providing explicit evidence for backward compatibility is essential. In the revised version, we will update the manuscript to include: (1) a formal grammar specification for the extended Match format, (2) concrete example .match files for the proposed virtual notes and section annotations, and (3) an analysis demonstrating that existing parsers can ignore the new constructs without ambiguity. These additions will substantiate the claim and be placed in a dedicated section on format specification. revision: yes
-
Referee: [Use-cases] Use-case demonstrations: the two representative scenarios are described at the design level only; the manuscript supplies neither sample encoded files nor any validation (e.g., round-trip parsing tests or alignment-error metrics) that would confirm the new constructs function as intended.
Authors: We acknowledge that the use-case section would be strengthened by including actual encoded examples and validation. We will revise the manuscript to append sample .match files for the piano rehearsal and basso continuo use-cases. Additionally, we will include round-trip parsing tests and discuss how the alignments can be validated in the context of the applications, potentially adding alignment-error metrics where relevant to the use-cases. revision: yes
Circularity Check
No circularity: direct proposal of format extension without self-referential derivation
full rationale
The paper is a constructive proposal for extending the Match file format via virtual pointer notes and expanded section lines to encode non-unique alignments. No equations, fitted parameters, predictions, or uniqueness theorems appear in the provided text. The central claim is the design itself, not a reduction of any output to its own inputs by construction. Backward-compatibility is asserted as a property of the proposal rather than derived from a self-citation chain or ansatz. This is a self-contained design contribution with no load-bearing circular steps.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Existing alignment encoding formats provide unique correspondences between notes
invented entities (2)
-
virtual score notes
no independent evidence
-
virtual performance notes
no independent evidence
Reference graph
Works this paper leans on
-
[1]
Chen, C.-T., Jang, J.-S. R., & Liou, W. (2014). Improved score-performance alignment algorithms on polyphonic music. In 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , 1365–1369. https://doi.org/10.1109/icassp.2014.6853820 Gingras, B., & McAdams, S. (2011). Improved Score-performance Matching Using Both Structural ...
-
[2]
https://doi.org/10.5281/zenodo.1414940 Music Encoding Initiative, Roland, P., Kepper, J., Bohl, B. W., Cheng, J., Devaney, J., Dörner, S., Fujinaga, I., Hankinson, A., Kelnreiter, F., Komives, Z., Liska, U., Münnich, S., Pacha, A., Pfeffer, N., Plaksin, A., Porter, A., Pugin, L., Regimbal, J., … Zhou, Y. (2025). music-encoding/music-encoding: MEI 5.1 (5.1...
-
[3]
https://doi.org/10.5281/zenodo.17811417 Štefunko, A., Chiruthapudi, S., Hajič, J
, Daejeon, South Korea. https://doi.org/10.5281/zenodo.17811417 Štefunko, A., Chiruthapudi, S., Hajič, J. J., & Cancino-Chacón, C. E. (2025, September 10). Basso Continuo Goes Digital: Collecting and Aligning a Symbolic Dataset of Continuo Performance. In The AI Music Creativity Conference (AIMC), Brussels, Belgium. https://doi.org/10.5281/zenodo.16946799...
-
[4]
E., Foscarin, F., McLeod, A
https://archives.ismir.net/ismir2019/latebreaking/000049.pdf Peter, S., Cancino-Chacón, C. E., Foscarin, F., McLeod, A. P., Henkel, F., Karystinaios, E., & Widmer, G. (2023). Automatic Note-Level Score-to-Performance Alignments in the ASAP Dataset. In Transactions of the International Society for Music Information Retrieval , 6 (1), 27 -
2023
-
[5]
https://doi.org/10.5334/TISMIR.149
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.