Lexically Constrained Decoding for Sequence Generation Using Grid Beam Search

By Chris Hokamp, Qun Liu. 2017

460 citations recorded by the source corpus.

We present Grid Beam Search (GBS), an algorithm which extends beam search to allow the inclusion of pre-specified lexical constraints. The algorithm can be used with any model which generates sequences token by token. Lexical constraints take the form of phrases or words that must be present in the output sequence. This is a very general way to incorporate auxillary knowledge into a model’s output without requiring any modification of the parameters or training data. We demonstrate the feasibility and flexibility of Lexically Constrained Decoding by conducting experiments on Neural Interactive-Predictive Translation, as well as Domain Adaptation for Neural Machine Translation. Experiments show that GBS can provide large improvements in translation quality in interactive scenarios, and that, even without any user input, GBS can be used to achieve significant gains in performance in domain adaptation scenarios.

Subfields: Artificial Intelligence, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yejin Choi
  2. Mohit Bansal
  3. Hannaneh Hajishirzi
  4. Jianfeng Gao
  5. Luke S. Zettlemoyer
  6. Noah A. Smith
  7. Percy Liang
  8. Graham Neubig

In Natural Language Processing

  1. Yejin Choi
  2. Hannaneh Hajishirzi
  3. Mohit Bansal
  4. Luke S. Zettlemoyer
  5. Noah A. Smith
  6. Jianfeng Gao
  7. Percy Liang
  8. Caiming Xiong

Citations in the corpus