Information and Media Technologies
Online ISSN : 1881-0896
ISSN-L : 1881-0896
Computing
Distance and Similarity of Time-span Trees
Satoshi TojoKeiji Hirata
著者情報
ジャーナル フリー

2013 年 8 巻 2 号 p. 347-354

詳細
抄録

Time-span tree in Lerdahl and Jackendoff's theory [12] has been regarded as one of the most dependable representations of musical structure. We first show how to formalize the time-span tree in feature structure, introducing head and span features. Then, we introduce join and meet operations among them. The span feature represents the temporal length during which the head pitch event is most salient. Here, we regard this temporal length as the amount of information which the pitch event carries; i.e., when the pitch event is reduced, the information comparable to the length is lost. This allows us to define the notion of distance as the sum of lost time-spans. Then, we employ the distance as a promising candidate of stable and consistent metric of similarity. We show the distance possesses proper mathematical properties, including the uniqueness of the distance among the shortest paths. After we show examples with concrete music pieces, we discuss how our notion of distance is positioned among other notions of distance/similarity. Finally, we summarize our contributions and discuss open problems.

著者関連情報
© 2013 Information Processing Society of Japan
前の記事 次の記事
feedback
Top