Generation of sample melody using changeable type Markov process

Abstract

Many of composition support software marketed now hold the faults that neither individuality nor the peculiar characteristic of the user who uses the software are demonstrated easily enough. We have already proposed the algorithm that offers the sample melody that becomes the hint of the composition using the linear Markov process to improve these faults. We confirmed the composition in which individuality and the peculiar characteristic of the user of this software were reflected by some experiments was able to be done. However, this algorithm had the fault that the note was consecutive more than the necessity. Then, we solved this problem by adding the function to relocate the following note when the note was consecutive more than the necessity. In addition, we thought the length of the producing note was changed by using the prior probability. As a result, the algorithm where abundant sample melodies were able to be produced even by little data was completed.