Skip to main content

Network transition chord progressions

Project description

Chord Progression Network

Network transition chord progression generator

DESCRIPTION

This class generates network transition chord progressions. The transitions are given by a net of scale positions, and the chord "flavors" are defined by a chord_map of types. The chords that are returned are either named chords or lists of three or more named notes with octaves.

The chord types are as follows:

'' (i.e. an empty string) means a major chord.
'm' signifies a minor chord.
'7' is a seventh chord
'M7' is a major 7th chord and 'm7' is a minor 7th.
'dim' is a diminished chord and 'aug' is augmented.
'9', '11', and '13' are extended 7th chords.
'M9', 'M11', and 'M13' are extended major-7th chords.
'm9', 'm11', and 'm13' are extended minor-7th chords.

The scale must be specified with one of the known scales listed on the musical-scales page. A custom scale of named notes (with appropriate net and chord_map attributes) may also be given. Traditional modes (Ionian, Dorian, etc) have known chord_maps. For all other scales, a chord_map should be given in the constructor.

For the traditional modes, the chord_maps are as follows: The "Ionian" mode (major scale) is ['', 'm', 'm', '', '', 'm', 'dim']. "Dorian" is ['m', 'm', '', '', 'm', 'dim', ''], etc. A "chromatic" scale is all minors.

The tonic attribute means that if the first chord of the progression is being generated, then for 0 choose a random successor of the first chord, as defined by the net attribute. For 1, return the first chord in the scale. For any other value, choose a random value of the entire scale.

The resolve attribute means that if the last progression chord is being generated, then for 0 choose a random successor. For 1, return the first chord in the scale, and for any other value, choose a random value of the entire scale. In all other cases (i.e. the middle chords of the progression), choose a random successor.

By default, all chords and notes with accidentals are returned as sharps. If you want flats, set the flat attribute to True in the constructor.

If the substitute attribute is set to True, then the progression chords are subject to extended, "jazz" chord, including tritone substitution. This module performs chord substitution depending on the sub_cond lambda that acts 30% of the time. For now, for this work-in-progress advanced option, please see the substitution() method in the source...

Please see the Tests.py program, in this distribution for usage hints. :)

SYNOPSIS

from chord_progression_network import Generator

neighbors = [ i for i in range(1, 8) ] # 1 through 7
transitions = [ 1 for _ in range(1, 8) ] # equal probability

g = Generator( # defaults
    max=8,
    scale_note='C',
    scale_name='major',
    octave=4,
    net={
        1: neighbors,
        2: neighbors,
        3: neighbors,
        4: neighbors,
        5: neighbors,
        6: neighbors,
        7: neighbors,
    },
    weights={
        1: transitions,
        2: transitions,
        3: transitions,
        4: transitions,
        5: transitions,
        6: transitions,
        7: transitions,
    },
    chord_map=[ '', 'm', 'm', '', '', 'm', 'dim' ],
    tonic=1,
    resolve=1,
    flat=False,
    chord_phrase=False,
    substitute=False,
    verbose=False,
)
phrase = g.generate()

MUSICAL EXAMPLES

from music21 import chord, stream
from chord_progression_network import Generator

g = Generator(verbose=True)
phrase = g.generate()

s = stream.Score()
p = stream.Part()

for notes in phrase:
    p.append(chord.Chord(notes, type='whole'))

s.append(p)
s.show()
from music21 import chord, duration, stream
from chord_progression_network import Generator
from random_rhythms import Rhythm

r = Rhythm(durations=[1, 3/2, 2])
motifs = [ r.motif() for _ in range(4) ]

s = stream.Score()
p = stream.Part()

# simplistic example: all ones = equal probability
weights = [ 1 for _ in range(1,7) ]

g = Generator(
    scale_name='whole-tone scale',
    net={
        1: [2,3,4,5,6],
        2: [1,3,4,5,6],
        3: [1,2,4,5,6],
        4: [1,2,3,5,6],
        5: [1,2,3,4,6],
        6: [1,2,3,4,5],
    },
    weights={ i: weights for i in range(1,6) }
    chord_map=['m'] * 6,
    substitute=True,
)

for m in motifs:
    g.max = len(m)
    phrase = g.generate()
    for i, d in enumerate(m):
        c = chord.Chord(phrase[i])
        c.duration = duration.Duration(d)
        p.append(c)

s.append(p)
s.show()

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

chord_progression_network-0.2.1.tar.gz (44.5 kB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

chord_progression_network-0.2.1-py3-none-any.whl (30.6 kB view details)

Uploaded Python 3

File details

Details for the file chord_progression_network-0.2.1.tar.gz.

File metadata

File hashes

Hashes for chord_progression_network-0.2.1.tar.gz
Algorithm Hash digest
SHA256 6ac4de81e139f920d549d3dfcf4c4937ca0580ccba580bead4926ddf001386fa
MD5 acf49eecf64a8f7bce5c5aad5f404d2b
BLAKE2b-256 fc4629040abb760211e49166b4f4f61db23d994635bfe142330f51ecfb86849c

See more details on using hashes here.

File details

Details for the file chord_progression_network-0.2.1-py3-none-any.whl.

File metadata

File hashes

Hashes for chord_progression_network-0.2.1-py3-none-any.whl
Algorithm Hash digest
SHA256 510a3a8abc4a5d7570b81cfb2fcfa9b9d298457d265bcecc66cab5a223579579
MD5 bc2ce6e2f586106d6248423ecc76834a
BLAKE2b-256 29d96c095c9b0cbfe3fac5f137e2cde4f3d0a1f73ea04f93045a05d3c8d377c7

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page