Language Generation via Combinatorial Constraint Satisfaction: A Tree Search Enhanced Monte-Carlo Approach

Maosen Zhang, Nan Jiang, Lei Li, Yexiang Xue

Keywords: Constraint Language Generation, Combinatorial Constraint Satisfaction, MCMC

TL;DR: We present a combinatorial constraint satisfaction approach for language generation tasks.

Abstract:

Generating natural language under complex constraints is a principal formulation towards controllable text generation.
We present a framework to allow the specification of combinatorial constraints for sentence generation. We propose TSMH, an efficient method to generate high likelihood sentences with respect to a pre-trained language model while satisfying the constraints.
Our approach is highly flexible, requires no task-specific training, and leverages efficient constraint satisfaction solving techniques. To better handle the combinatorial constraints, a tree search algorithm is embedded into the proposal process of the Markov chain Monte Carlo (MCMC) to explore candidates that satisfy more constraints. Compared to existing MCMC approaches, our sampling approach has a better mixing performance. Experiments show that TSMH achieves consistent and significant improvement on multiple language generation tasks.

Community Implementations: [ 1 code implementation](https://www.catalyzex.com/paper/arxiv:2011.12334/code)