Papers
Topics
Authors
Recent
Search
2000 character limit reached

Psychological constraints on string-based methods for pattern discovery in polyphonic corpora

Published 17 Jul 2018 in cs.SD and eess.AS | (1807.06700v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.