Using factor oracles for machine improvisation

DOI10.1007/S00500-004-0385-4zbMath1064.00505OpenAlexW1967957118MaRDI QIDQ1769665

Gérard Assayag, Shlomo Dubnov

Publication date: 4 April 2005

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-004-0385-4

zbMATH Keywords

Suffix treesComputer musicFactor oracleImprovisationIncremental parsingPrediction suffix treesVariable Markov models: Machine learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) General applied mathematics (00A69)

Related Items (5)

Converting suffix trees into factor/suffix oracles ⋮ Statistical properties of factor oracles ⋮ Music and combinatorics on words: a historical survey ⋮ Creating improvisations on chord progressions using suffix trees ⋮ Statistical Properties of Factor Oracles

This page was built for publication: Using factor oracles for machine improvisation