GTTM III: Learning-Based Time-Span Tree Generator Based on PCFG
M Hamanaka, K Hirata, S Tojo - International Symposium on Computer …, 2015 - Springer
An automatic analyzer based on the generative theory of tonal music (GTTM) for acquiring a
time-span tree is described. Although an analyzer based on GTTM was previously reported,
it requires manually manipulating 46 adjustable parameters on a computer screen in order
to analyze a time-span tree properly. We reformalized the time-span reduction in GTTM on
the basis of a probabilistic model called probabilistic context-free grammar, which enables
acquiring the most likely time-span tree. Applying leave-one-out cross validation over 300 …
time-span tree is described. Although an analyzer based on GTTM was previously reported,
it requires manually manipulating 46 adjustable parameters on a computer screen in order
to analyze a time-span tree properly. We reformalized the time-span reduction in GTTM on
the basis of a probabilistic model called probabilistic context-free grammar, which enables
acquiring the most likely time-span tree. Applying leave-one-out cross validation over 300 …
GTTM III: Learning-Based Time-Span Tree Generator Based on PCFG
K Hirata, M Hamanaka, S Tojo - (No Title), 2016 - cir.nii.ac.jp
An automatic analyzer based on the generative theory of tonal music (GTTM) for acquiring a
time-span tree is described. Although an analyzer based on GTTM was previously reported,
it requires manually manipulating 46 adjustable parameters on a computer screen in order
to analyze a time-span tree properly. We reformalized the time-span reduction in GTTM on
the basis of a probabilistic model called probabilistic context-free grammar, which enables
acquiring the most likely time-span tree. Applying leave-one-out cross validation over 300 …
time-span tree is described. Although an analyzer based on GTTM was previously reported,
it requires manually manipulating 46 adjustable parameters on a computer screen in order
to analyze a time-span tree properly. We reformalized the time-span reduction in GTTM on
the basis of a probabilistic model called probabilistic context-free grammar, which enables
acquiring the most likely time-span tree. Applying leave-one-out cross validation over 300 …
以上显示的是最相近的搜索结果。 查看全部搜索结果