Technology nowadays takes an increasing part of “creativity” in live music software such as the OMax-ImproteK-Djazz improvisation environment. Specifically, Djazz implements techniques for indexing and creating improvisations using a given chord progression. It relies on a database that we call a dictionary, storing musical sequences (audio or MIDI) associated with known chord changes. We define an improvisation on a given chord progression x as a sequence obtained by concatenating musical phrases identified with factors of x that can be found in the dictionary. Given a query sequence x and a dictionary D, we present an algorithm that finds an improvisation on x with respect to D. We use the suffix tree data structure to index D and then produce a graph formulation of the problem in order to find a suitable improvisation in linear time, with respect to the length of x.

如今，技术在现场音乐软件（例如， OMax-ImproteK-Djazz即兴环境。特别，爵士乐使用给定的和弦进行音色索引和创建即兴演奏的技巧。它依赖于我们称为字典的数据库，该数据库存储与已知和弦变化相关的音乐序列（音频或MIDI）。我们将给定的和弦进行x定义为即兴演奏，即通过将识别为x因子的音乐短语连接到字典中而获得的序列。给定一个查询序列x和一个字典D，我们提出一种算法，该算法找到x关于D的即兴表现。我们使用后缀树数据结构来索引D然后生成问题的图形表述，以便相对于x的长度在线性时间内找到合适的即兴表现。