Skip to main content
SpringerLink
Log in

Constrained Markov Sequence Generation

Applications to Music and Text

  • Book
  • Latest edition

Overview

Authors:
  1. François Pachet

    1. Laboratoire d'Informatique de Paris (LIP 6), Université Pierre et Marie Curie (UPMC), Paris, France

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Alexandre Papadopoulos

    1. Laboratoire d'Informatique de Paris (LIP 6), Université Pierre et Marie Curie (UPMC), Paris, Ireland

    View author publications

    You can also search for this author in PubMed   Google Scholar

  3. Pierre Roy

    1. Sony Computer Science Laboratory (CSL), Paris, France

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Deals with the problem of generating sequences in the style of a given corpus, in text or music
  • Overcomes limitation of Markov models, they capture only local information, by formulating them as constraint satisfaction problems (CSPs)
  • Valuable for practitioners, researchers, and graduate students engaged with algorithmic composition and constraint satisfaction

Buy print copy

Keywords

  • Algorithmic composition
  • Random walk (RW)
  • Markov chains
  • Markov constraints
  • Chord generation
  • Melody generation
  • Virtuoso melodies
  • Content generation
  • Allen relations
  • Max order
  • Plagiarism
  • Plagiarism
  • Belief propagation
  • Palindromes
  • N-grams
  • Interactive composition
  • Constraint satisfaction problem (CSP)
  • Elementary Markov constraint (EMC)
  • Variable-order Markov model (VMM)
  • Domain consistency (DC)

About this book

This book deals with the problem of generating sequences in the style of a given corpus, in text or music. In particular, the authors study Markov models, which have long been used for capturing basic statistical information about how elements of a given alphabet are put together in representative sequences, formulating them as constraint satisfaction problems (CSPs), a formulation which opens the door to many extensions of basic Markov models through the modularity of constraint satisfaction.

The book will be valuable to practitioners, researchers, and graduate students engaged with algorithmic composition and constraint satisfaction.

Authors and Affiliations

  • Laboratoire d'Informatique de Paris (LIP 6), Université Pierre et Marie Curie (UPMC), Paris, France

    François Pachet

  • Laboratoire d'Informatique de Paris (LIP 6), Université Pierre et Marie Curie (UPMC), Paris, Ireland

    Alexandre Papadopoulos

  • Sony Computer Science Laboratory (CSL), Paris, France

    Pierre Roy

Bibliographic Information

  • Book Title: Constrained Markov Sequence Generation

  • Book Subtitle: Applications to Music and Text

  • Authors: François Pachet, Alexandre Papadopoulos, Pierre Roy

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer Nature Switzerland AG 2100

  • Hardcover ISBN: 978-3-319-43496-4Due: To be confirmed

  • eBook ISBN: 978-3-319-43497-1Due: To be confirmed

  • Edition Number: 1

Publish with us

Policies and ethics

Back to top

Search

Navigation