

























Researchers often divide symbolic music corpora into contiguous sequences of n events (called n-grams) for the purposes of pattern discovery, key finding, classification, and prediction. What is more, several studies have reported improved task performance when using psychologically motivated weighting functions, which adjust the count to privilege n-grams featuring more salient or memorable events (e.g., Krumhansl, 1990). However, these functions have yet to appear in harmonic pattern discovery algorithms, which attempt to discover the most recurrent chord progressions in complex polyphonic corpora. This study examines whether psychologically-motivated weighting functions can improve harmonic pattern discovery algorithms. Models using various n-gram selection methods, weighting functions, and ranking algorithms attempt to discover the most conventional closing harmonic progression in the common-practice period, ii6-"I64"-V7-I, with the progression's mean reciprocal rank serving as an evaluation metric for model comparison.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。