A Probabilistic Context-Free Grammar for Melodic Reduction
نویسنده
چکیده
This article presents a method used to find tree structures in musical scores using a probabilistic grammar for melodic reduction. A parsing algorithm is used to find the optimal parse of a piece with respect to the grammar. The method is applied to parse phrases from Bach chorale melodies. The statistical model of music defined by the grammar is also used to evaluate the entropy of the studied pieces and thus to estimate a possible information compression figure for scores.
منابع مشابه
Automatic Melodic Reduction Using a Supervised Probabilistic Context-Free Grammar
This research explores a Natural Language Processing technique utilized for the automatic reduction of melodies: the Probabilistic Context-Free Grammar (PCFG). Automatic melodic reduction was previously explored by means of a probabilistic grammar [11] [1]. However, each of these methods used unsupervised learning to estimate the probabilities for the grammar rules, and thus a corpusbased evalu...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملOn the Ability of a Probabilistic Context-Free Grammar for Reducing Ambiguity
This paper studies the ambiguity reduction ability of the probabilistic contextfree grammar. We theoretically analyze the common behavior of any probabilistic context-free grammar. Moreover, we con rm by experiments that a probabilistic context-free grammar learnt from Japanese corpus has the ambiguity reduction ability as expected by the theoretical analysis.
متن کاملQuery Parsing Using Probabilistic Tree Grammars
The tree representation, using rhythm for defining the tree structure and pitch information for node labeling has proven to be effective in melodic similarity computation. In this paper we propose a solution representing melodies by tree grammars. For that, we infer a probabilistic context-free grammars for the melodies in a database, using their tree coding (with duration and pitch) and classi...
متن کاملClassifying Melodies Using Tree Grammars
Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in general, and particularly in the presence of noisy data. A number of works have addressed the problem of what is the best representation for symbolic music in this context. The tree representation, using rhythm for defining the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007