Using Factor Oracles for Machine Improvisation
نویسندگان
چکیده
منابع مشابه
Using Factor Oracles for Machine Improvisation
We describe variable markov models we have used for statistical learning of musical sequences, then we present the factor oracle, a data structure proposed by Crochemore & al for string matching. We show the relation between this structure and the previous models and indicate how it can be adapted for learning musical sequences and generating improvisations in a real-time context.
متن کاملFourier Oracles for Computer-Aided Improvisation
The mathematical study of the diatonic and chromatic universes in the tradition of David Lewin (9) and John Clough (6) is a point of departure for several recent investigations. Surprisingly, Lewin’s original idea to apply finite Fourier transform to musical structures has not been further investigated for four decades. It turns out that several music-theoretically interesting properties of cer...
متن کاملInteraction with Machine Improvisation
We describe two multi-agent architectures for an improvisation oriented musician-machine interaction systems that learn in real time from human performers. The improvisation kernel is based on sequence modeling and statistical learning. We present two frameworks of interaction with this kernel. In the first, the stylistic interaction is guided by a human operator in front of an interactive comp...
متن کاملMachine Improvisation with Formal Specifications
We define the problem of machine improvisation of music with formal specifications. In this problem, one seeks to create a random improvisation of a given reference melody that however satisfies a “specification” encoding constraints that the generated melody must satisfy. More specifically, we consider the scenario of generating a monophonic Jazz melody (solo) on a given song harmonization. Th...
متن کاملConstructing Factor Oracles
A factor oracle is a data structure for weak factor recognition. It is an automaton built on a string p of length m that is acyclic, recognizes at least all factors of p, has m+1 states which are all final, and has m to 2m−1 transitions. In this paper, we give two alternative algorithms for its construction and prove the constructed automata to be equivalent to the automata constructed by the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2004
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-004-0385-4