Skip to main navigation Skip to search Skip to main content

Probabilistic Generation of Sequences under Constraints

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

There is growing interest in the ability to generate natural and meaningful sequences (e.g., in domains such as language or music). Many existing sequence generation models, including Markov and neural algorithms, capture local coherence, but have no mechanism for applying the structural constraints that are so often essential for the development of meaning. We describe a novel solution to this problem which combines hidden Markov models with constraints, allowing sequences which obey user-defined constraints to be generated according to data-driven probability distributions. Compared to other constrained probabilistic solutions, our Constrained Hidden Markov Process (CHiMP) has significantly greater expressivity, allowing the user to generate constrained sequences that are longer and which have more numerous structural constraints.

Original languageEnglish
Title of host publication2020 Intermountain Engineering, Technology and Computing, IETC 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728142913
DOIs
StatePublished - Oct 2 2020
Externally publishedYes
Event1st Intermountain Engineering, Technology and Computing, IETC 2020 - Orem, United States
Duration: Oct 2 2020Oct 3 2020

Publication series

Name2020 Intermountain Engineering, Technology and Computing, IETC 2020

Conference

Conference1st Intermountain Engineering, Technology and Computing, IETC 2020
Country/TerritoryUnited States
CityOrem
Period10/2/2010/3/20

Keywords

  • Markov processes
  • constraint satisfaction
  • sequence generation

Fingerprint

Dive into the research topics of 'Probabilistic Generation of Sequences under Constraints'. Together they form a unique fingerprint.

Cite this