Venue: NAACL 2021

# Fudge: Controlled Text Generation With Future Discriminators

 Kevin Yang

UC Berkeley

yangk@berkeley.edu Dan Klein

UC Berkeley

klein@berkeley.edu

###### Abstract

We propose Future Discriminators for Generation (Fudge), a flexible and modular method for controlled text generation. Given a pre-existing model \({\cal G}\) for generating text from a distribution of interest, Fudge enables conditioning on a desired attribute \(a\) (for example, formality) while requiring access only to \({\cal G}\)'s output logits. Fudge learns an attribute predictor operating on a partial sequence, and uses this predictor's outputs to adjust \({\cal G}\)'s original probabilities. We show that Fudge models terms corresponding to a Bayesian decomposition of the conditional distribution of \({\cal G}\) given attribute \(a\). Moreover, Fudge can easily compose predictors for multiple desired attributes. We evaluate Fudge on three tasks -- couplet completion in poetry, topic control in language generation, and formality change in machine translation -- and observe gains in all three tasks.

## 1 Introduction

Recent advances in large pretrained language models allow us to generate increasingly realistic text by modeling a distribution \(P(X)\) over natural language sequences \(X\). The distribution \(P(X)\) may be truly unconditional, as is common in language modeling, or it may model \(P(X|I)\) conditioned on some input \(I\), as in machine translation or summarization.

We are frequently interested in _controlled_ text generation, the task of generating text conditioned on an _additional_ desirable attribute \(a\) which is not already built into \(P(X)\). That is, we would like to model \(P(X|a)\) (or possibly \(P(X|I,a)\); henceforth we will drop \(I\) from the notation for simplicity). For example, \(P(X)\) may be a pretrained translation model for Spanish inputs \(I\) to English outputs \(X\), but we may wish to additionally constrain the outputs to possess a new attribute \(a\), e.g., formality, which we did not optimize for during training.

Unfortunately, once we have already obtained an unconditioned \(P(X)\) defined as the output distribution of some large generative model \({\cal G}\), it is nontrivial to add conditioning on a new attribute \(a\) without either training a new model from scratch or fine-tuning with additional data. Although in principle we can trivially sample from \(P(X|a)\) via rejection sampling from \(P(X)\), rejection sampling may be highly inefficient in practice. On the other hand, while generating according to attribute \(a\), \(P(X)\) should be left otherwise intact: in the previous translation formality example, it is pointless to generate formal English outputs if they do not preserve the original Spanish meaning.

In light of these concerns, we propose Future Discriminators for Generation (Fudge), a flexible and modular method for modeling \(P(X|a)\) which accesses only the output probabilities of the generative model \({\cal G}\) which defines \(P(X)\). Fudge learns a binary predictor for whether attribute \(a\) will become true in the complete future, based on an incomplete sequence prefix (Sec. 3). Multiplying the output probabilities of this predictor with \({\cal G}\)'s original probabilities and then renormalizing yields a model for the desired \(P(X|a)\) via Bayes' Rule.

We run experiments on three controlled text generation tasks -- couplet completion in poetry, topic control in language generation, and formality change in machine translation -- showing our method's broad applicability. Additionally, we demonstrate the modularity of Fudge by composing multiple attribute constraints in both the couplet and topic control tasks. In our experiments, we find that Fudge is highly effective at attribute control, outperforming both a baseline which directly fine-tunes \({\cal G}\) and also a strong gradient-based method (Polm[2]). Our code is available at [https://github.com/yangkevin2/naacl-2021-fudge-controlled-generation](https://github.com/yangkevin2/naacl-2021-fudge-controlled-generation).

## 2 Related Work

Ideally, a controlled text generation method should efficiently control for \(a\) while preserving

as much as possible. Recent work on controlled text generation has greatly advanced our ability to control for a required attribute \(a\) flexibly and cheaply, with varying degrees of modification to the original model \({\cal G}\) which defines \(P(X)\).

One line of work fine-tunes a pretrained model for a desired attribute Ficler and Goldberg (2017); Yu et al. (2017); Ziegler et al. (2019). The result is a class-conditional language model (CCLM). However, it is difficult to isolate the desired attribute from the distribution shift between \({\cal G}\) and the fine-tuning dataset Hu et al. (2017); John et al. (2018); Lazaridou et al. (2020), i.e., it is nontrivial to preserve the desirable qualities of the \(P(X)\) modeled by \({\cal G}\). One may also need to fine-tune separately for each attribute of interest. CtrlKeskar et al. (2019) partially addresses these issues by providing 55 attribute control codes for a large language model trained from scratch, although this is expensive. Very recently, GeDiKrause et al. (2020) achieves strong performance by using CCLM generators as discriminators, though it relies on several heuristics. More broadly, text generation models for style transfer Hu et al. (2017); Lample et al. (2018); Dai et al. (2019), summarization See et al. (2017); Gehrmann et al. (2018); Zaheer et al. (2020), and machine translation Lample et al. (2018); Ng et al. (2019); Lewis et al. (2019) can also be viewed as CCLM's for different "attributes."

A second type of approach instead conditions on a desired attribute by backpropagating gradients, either to directly modify model activations Dathathri et al. (2019); Liu et al. (2020) or to find a trigger string Wallace et al. (2019, 2020). Such methods often exhibit a high degree of attribute control, and can be used in adversarial attacks Wallace et al. (2020). In fact, Subramani et al. (2019) show that by carefully modifying the latent state, one can cause the base \({\cal G}\) to produce arbitrary outputs.

A third class of methods, referred to as weighted decoding (WD), assumes access only to \(P(X)\) (i.e., \({\cal G}\)'s output logits), and operates directly on these logits Ghazvininejad et al. (2017); Holtzman et al. (2018); Cohn-Gordon et al. (2018); Shen et al. (2019). Compared to other approaches, WD methods are relatively interpretable in how they obtain \(P(X|a)\) from \(P(X)\), but prior WD implementations have been observed to perform poorly in controlled text generation See et al. (2019); Dathathri et al. (2019). While Fudge shares a Bayesian motivation with other WD methods, Fudge follows the Bayesian factorization more closely in implementation (Sec. 3). The key distinguishing feature of Fudge is that it models whether attribute \(a\) will be true in the _future_, rather than in the _present_. We find that Fudge substantially outperforms previous WD approaches in our experiments (Sec. 4.2).

## 3 Future Discriminators for Generation

We now explain the details of our proposed method, Future Discriminators for Generation (Fudge), and show that it corresponds to modeling the desired conditional distribution \(P(X|a)\).

For a given language generation task, assume we have an autoregressive model \({\cal G}\) (e.g., a large pretrained language model) which models \(P(x_{i}|x_{1:i-1})\) for tokens \(x_{1}\ldots x_{i}\). Letting \(X=x_{1:n}\) denote a completed sequence, \({\cal G}\) can sample from \(P(X)=P(x_{1:n})\) one token at a time by factoring \(P(X)\):

\[P(X)=\prod_{i=1}^{n}P(x_{i}|x_{1:i-1})\]

To condition on attribute \(a\), we instead model \(P(X|a)\). This requires a model for \(P(x_{i}|x_{1:i-1},a)\), modifying the previous factorization:

\[P(X|a)=\prod_{i=1}^{n}P(x_{i}|x_{1:i-1},a)\]

If we model \(P(x_{i}|x_{1:i-1},a)\) directly, we obtain a class-conditional language model (CCLM). We can learn the CCLM by e.g., fine-tuning \({\cal G}\) depending on the available data, possibly with some structural modification to \({\cal G}\) to accommodate conditioning.

However, Fudge instead relies on the following Bayesian factorization, exchanging \(x_{i}\) and \(a\) conditioned on \(x_{1:i-1}\):

\[P(x_{i}|x_{1:i-1},a)\propto P(a|x_{1:i})P(x_{i}|x_{1:i-1})\]

The second term is exactly the quantity modeled by the base \({\cal G}\). It then suffices to model the first term, \(P(a|x_{1:i})\), with a binary classifier \({\cal B}\) for the attribute \(a\) given a prefix \(x_{1:i}\). Intuitively, one can view \({\cal B}\) as rescoring or reranking \({\cal G}\)'s original hypotheses.

We emphasize that although \({\cal B}\) takes a _prefix_\(x_{1:i}\) as input, it predicts whether attribute \(a\) will _in the future_ be satisfied for the _completed_ generation \(x_{1:n}\). For instance, suppose we are given a dataset of examples \(\{(x_{1:n},a^{\prime})\}\) with \(a^{\prime}\) being the values of binary indicators for the desired \(a\) (i.e., if \(a\) is formality, then \(a^{\prime}\) is 0 or 1 when \(x_{1:n}\) is inform 

or formal respectively). For each training example \((x_{1:n},a^{\prime})\), we train our classifier \(\mathcal{B}\) using all pairs \((x_{1:i},a^{\prime})\); that is, we construct a separate example from each prefix \(x_{1:i}\) of \(x_{1:n}\). Our approach contrasts with previous methods such as Dathathri et al. (2019), which greedily optimize for \(a\) on the immediate extension \(x_{1:i+1}\). One particular benefit is that Fudge naturally plans for the future: in the example for generating text on the "space" topic in Table 6, Fudge writes about a "mysterious ship" despite "ship" itself not being in the given "space"-topic bag of words, because "mysterious ship" easily leads into a mention of one of the targeted "space" words ("Earth"). Similarly, in the first couplet completion example in Table 3, Fudge needs to rhyme with "fear" after exactly ten syllables. After seven syllables, it could reasonably generate the word "clear," but it first generates the adverb "pretty" in order to set up the generation of "clear" as the tenth syllable.

Fudge's implementation is shown schematically in Figure 1, and is quite simple in practice. Fudge just needs to learn a \(\mathcal{B}\) (red in Figure 1) sharing tokenization with \(\mathcal{G}\) (dark blue). It then converts \(\mathcal{B}\)'s output into probabilities (red table in Figure 1), and multiplies with the original output probabilities from \(\mathcal{G}\) (dark blue table), to obtain unnormalized probabilities \(P(x_{i},a|x_{1:i-1})\) (purple table). Finally, renormalizing over the output vocabulary yields the desired distribution \(P(x_{i}|x_{1:i-1},a)\). In practice, we operate in the log-probability space for numerical stability.

To improve computational efficiency, we typically choose \(\mathcal{B}\) to be lightweight relative to \(\mathcal{G}\). We also consider only the top 200 possibilities for \(x_{i}\) according to \(\mathcal{G}\) at each step, as a cheap approximation to the full distribution, and find that this works well in practice.1 In each task in Sec. 4, running Fudge on the test set takes no more than 15 minutes on a single Quadro RTX 6000 GPU.

Footnote 1: See Appendix H for ablations on the top-200 pruning.

Finally, as with other controlled generation approaches such as Dathathri et al. (2019), it is likely that augmenting Fudge with reranking approaches such as rejection sampling could improve output quality at the cost of compute time, although we do not comprehensively evaluate such extensions in this work.

### Advantages and Limitations

We highlight several additional potential advantages of Fudge compared to directly modeling \(P(x_{i}|x_{1:i-1},a)\) via e.g., a fine-tuned CCLM:

1. Fudge requires access only to \(P(X)\) (i.e., \(\mathcal{G}\)'s output logits) rather than \(\mathcal{G}\) itself.
2. \(\mathcal{G}\) can be freely swapped out for any other model that shares the same tokenization when larger models become available.
3. Given multiple conditionally independent attributes with predictors for each, Fudge can easily condition on the combination of these attributes in a modular fashion by summing their output log-probabilities (Sec. 4.1, 4.2).

Unfortunately, like previous methods, Fudge cannot fully guarantee that all outputs possess the desired attribute \(a\). In Fudge's case, this is due to the approximation inherent in modeling \(P(a|x_{1:i})\), as well as only considering the top 200 possible \(x_{i}\) for computational efficiency.

Figure 1: Illustration of one decoding step in Fudge, for an example where the desired attribute \(a\) is formality. A large pretrained model \(\mathcal{G}\) (dark blue) outputs unconditioned probabilities. Our binary predictor (red) predicts whether the eventual completed sequence will be formal for each possible continuation (computed for each candidate \(x_{3}\), e.g., “want”; holding \(a\) fixed). The probabilities for each \(x_{3}\) are multiplied (purple) and then renormalized to obtain \(P(x_{3}|x_{1:2},a)\), from which we sample the next token \(x_{3}=\)“prefer.”



Experiments

We run experiments on a range of controlled text generation tasks to evaluate the effectiveness of our proposed method: poetry couplet completion (Sec. 4.1), topic-controlled language generation (Sec. 4.2), and machine translation formality change (Sec. 4.3). For each task we discuss the evaluation setup, the specific details of our method and baselines, and finally experimental results.

### Poetry Couplet Completion

We begin with English poetry generation, a task that emphasizes well-formedness, and which has been studied in different forms by many previous works Zhang and Lapata (2014); Wang et al. (2016); Ghazvininejad et al. (2016, 2017). Our task here is couplet completion. Given the first line of an iambic pentameter couplet (e.g., Table 1), the model must generate a second line which (1) satisfies iambic pentameter, (2) rhymes with the first line, and (3) ends a sentence. The desired attribute \(a\) is defined as possessing all three properties, as evaluated by a rule-based checker \({\cal F}\) (Appendix A). Our test set is a collection of prefix lines of couplelets, collected from the ending couplet of each of Shakespeare's 154 sonnets.

**Metrics.** We consider four metrics.

1. _Success_, the fraction of couplet completions with the desired attribute \(a\), as checked by \({\cal F}\). This is the main metric.
2. _Grammaticality_, the probability of grammaticality given by a Roberta-based CoLA grammaticality model Liu et al. (2019); Warstadt et al. (2019), averaged over all outputs.
3. _Perplexivity_ of the completion conditioned on the prefix. Following Dathathri et al. (2019), since our models use GPT2-Medium Radford et al. (2019) as \({\cal G}\), we evaluate perplexity using GPT Radford et al. (2018).2 Footnote 2: See Appendix E for other perplexity measurements.
4. _Distinctness_ of completions, measured as the number of unique unigrams, bigrams, and trigrams across all samples, divided by the total number of words Li et al. (2015).

At test time, we decode until the model generates ten syllables followed by an end-of-sentence punctuation mark, or after the eleventh syllable (an automatic failure, since iambic pentameter requires exactly ten syllables).

Overall, because we define \(a\) using a rule-based \({\cal F}\) which is accessible during training, our formulation of couplet completion is a relatively clean task for evaluating the effectiveness of Fudge.

#### 4.1.1 Method and Baselines

**Fudge Instantiation.** The obvious approach is to learn a predictor for \({\cal F}\) directly. However, the three components of \(a\) -- meter, rhyme, and sentenceing -- should be roughly independent. Thus we assume conditional independence, and demonstrate the modularity of Fudge by constructing three separate predictors to be combined at test time:

1. \({\cal B}_{1}(x_{1:i})\) takes a text prefix \(x_{1:i}\), and predicts whether the completion \(x_{1:n}\) of prefix \(x_{1:i}\) will be in iambic meter. The model is an LSTM followed by a linear output layer.
2. \({\cal B}_{2}(x_{1:i},t,r)\) takes prefix \(x_{1:i}\), the number of syllables \(t\) between \(x_{i}\) and \(x_{n}\) for \(n\geq i\), and a rhyme sound \(r\).3 It predicts whether the completion \(x_{1:n}\) has the rhyme sound \(r\) at the end of token \(x_{n}\). The model is an LSTM with attention dependent on \(t\) and \(r\), followed by a shallow feedforward network, and is trained via noise-contrastive estimation Gutmann and Hyvarinen (2010).4 Footnote 3: Two words have the same “rhyme sound” \(r\) if they rhyme according to the CMU Pronouncing Dictionary Weide (1998). 4
Footnote 4: The output logits from \({\cal B}_{2}\) are unnormalized, but this does not affect Fudge after they are added to the output logits of \({\cal G}\) and softmaxed for sampling.
3. \({\cal B}_{3}(x_{1:i},t)\) takes prefix \(x_{1:i}\) and the number of syllables \(t\) between \(x_{i}\) and \(x_{n}\) for \(n\geq i\), and predicts whether \(x_{n}\) ends a sentence. The model is an LSTM followed by a shallow feed-forward network.

The predictors vary in architecture because \({\cal B}_{2}\) and \({\cal B}_{3}\) require inputs other than \(x_{1:i}\) -- in truth, they are _families_ of related predictors. We find that performance is not overly sensitive to the particulars of the predictor architectures (Appendix D).

\begin{table}
\begin{tabular}{l} So long as men can breathe or eyes can see, \\ So long lives this and this gives life to theee. \\ \end{tabular}
\end{table}
Table 1: An example couplet by William Shakespeare. Every second syllable is stressed, following iambic meter, and the last words of each line (see/thee) rhyme.

 

To train the discriminators, we sample a dataset of 10 million generations of varied length from GPT2-Medium. From these generations, we sample random subsequences \(x_{1:n}\) of roughly 10 to 30 syllables and truncate \(t\leq 10\) ending syllables. These truncations become inputs \(x_{1:i}\) to the predictors. For simplicity, we did not balance the class labels for e.g., the iambic predictor during training, although it is likely that doing so would improve performance.

At test time, we extract \(r\) from the given first line of the couplet, and initialize \(t=10\), updating at each step. We then modify the output logits of \(\mathcal{G}\) by simply adding the log-probabilities from \(\mathcal{B}_{1}\), \(\mathcal{B}_{2}\), and \(\mathcal{B}_{3}\), demonstrating the ease of composing constraints in Fudge.

**Baselines.** We compare to four baselines.5 Footnote 5: A system like Hafez [64], which enforces meter and rhyme at each decoding step using a hard constraint, could achieve perfect success rate. However, this approach relies on the meter and rhyme attributes being “prefix–checkable” at the word level: one can guarantee success by simply never selecting a word which immediately violates the constraint. This is often the case for simple rule-based constraints, but not for many other interesting attributes, such as the topic and formality attributes in our subsequent experiments. To preserve generality, Fudge does not rely on this ”prefix-checkable” property, and neither do our baselines.

1. \(\mathcal{G}\), the original GPT2-Medium.
2. Finetune, a CCLM which finetunes \(\mathcal{G}\) on similar inputs to those used for \(\mathcal{B}_{2}\) in Fudge. Since it is not obvious how to compose multiple CCLM's for different attributes, we train a single CCLM for all desired properties together. We condition by prefixing the input with (1) whether the last 10 syllables of the original untruncated \(x_{1:n}\) are iambic, (2) the rhyme sound at the end of \(x_{n}\), and (3) whether a sentence ends with \(x_{n}\). A special token is inserted 10 syllables from the end of \(x_{1:n}\).
3. Pplm [7], which uses shallow predictors learned from \(\mathcal{G}\)'s top-level hidden layer to modify \(\mathcal{G}\)'s states toward increasing probability of the desired attribute via gradient ascent. We decompose the predictors into the same iambic, rhyme sound, and end-of-sentence predictors as for Fudge, inserting an additional hidden layer in the shallow predictor when needed to incorporate additional input (the desired rhyme sound and/or number of syllables until end-of-sentence).
4. Shakespeare's original couplet completions.

All non-Shakespeare methods use top-\(k\) sampling with \(k=10\).

#### 4.1.2 Results

Even though our GPT2-Medium-generated training dataset is completely different from the test domain, and contains essentially zero examples of correct couplelets, Fudge is able to learn the desired attribute. As shown in Table 2, Fudge greatly outperforms all automated baselines in success rate.

Surprisingly, the Pplm baseline achieves zero success. We find that its iambic and rhyme predictors are very poor, so we hypothesize that the relevant information is not easily extractable from the last hidden layer of \(\mathcal{G}\). In contrast, Fudge's predictors operate directly on the raw text.

Funnily enough, Fudge even matches Shakepeare according to \(\mathcal{F}\), although this is largely due to the narrowness of \(\mathcal{F}\) and should not be taken se

\begin{table}
\begin{tabular}{l c c c c c c} \hline \hline  & _Correctness_ & \multicolumn{3}{c}{_Text Quality_} & \multicolumn{3}{c}{_Diversity_} \\ \cline{2-8} Method & **Success**\(\uparrow\) & Grammar \(\uparrow\) & Perplexity \(\downarrow\) & Dist-1 \(\uparrow\) & Dist-2 \(\uparrow\) & Dist-3 \(\uparrow\) \\ \hline \(\mathcal{G}\) & 0 & 0.52 & 44.3 \(\pm\) & 42.2 & 0.35 & 0.74 & 0.77 \\ Finetune & 0.21 & 0.44 & 55.8 \(\pm\) & 98.3 & 0.35 & 0.74 & 0.78 \\ Pplm & 0 & 0.54 & 60.8 \(\pm\) & 66.1 & 0.40 & 0.78 & 0.78 \\ Fudge & **0.44** & 0.44 & 70.9 \(\pm\) & 89.4 & 0.40 & 0.79 & 0.78 \\ \hline Shakespeare & **0.45** & 0.29 & 333.8 \(\pm\) & 418.9 & 0.44 & 0.81 & 0.79 \\ \hline \hline \end{tabular}
\end{table}
Table 2: Couplet completion results. Success (main metric), grammaticality, perplexity, and distinctness of different methods, tested on 154 prefix lines from Shakespeare sonnets. Fudge substantially outperforms automated baselines on success and maintains high diversity, although quality unsurprisingly suffers compared to the base \(\mathcal{G}\) due to the difficult constraint \(\mathcal{F}\). Note Shakespeare’s work is often “incorrect” due to the narrowness of our metric \(\mathcal{F}\);6 he also scores poorly on text quality because our evaluation models are intended for more modern English.

 

riously.6 Similarly, the grammaticality and perplexity metrics are designed for our automated baselines, and thus assign poor scores to Shakespeare's antiquated and flowery style.

Footnote 5: We define \(\mathcal{F}\) using somewhat narrow criteria (Appendix A), which capture only a subset of what Shakespeare considered to be well-written couplelets. The purpose of this task is to evaluate Fudge’s ability to satisfy a difficult well-formedness constraint compared to automated baselines, rather than to perfectly capture the human notion of an limbic pentameter couplet. Thus Shakespeare is marked wrong when the (1) uses archaic pronuncations, (2) uses loose rhymes, (3) elides syllables to fit meter, or (4) uses words missing from the CMU Pronouncing Dictionary. See Appendix A.1 for details. Of course, Shakespeare is only included as a whimsical point of reference; our generations obviously do not hold a candle to Shakespeare’s originals.

Fudge also maintains relatively fluent generation despite lower grammaticality and perplexity compared to \(\mathcal{G}\). See Table 3 for two successful examples. Interestingly, Fudge also increases diversity compared to \(\mathcal{G}\), perhaps due to the difficult constraint \(\mathcal{F}\) forcing Fudge to use lower-probability regions of the base distribution \(P(X)\).

Finally, it is possible (and trivial) to adjust the conditioning strength in Fudge by multiplying the binary predictors' output logits by a constant. However, this deviates from our Bayesian factorization of \(P(X|a)\), and we do not do so.

### Topic-Controlled Language Generation

Next, we explore topic control in English language generation. The desired attribute \(a\) is to be on-topic for a given topic, such as science or politics. To facilitate comparison with prior work, we largely follow the setup of Pplm Dathathri et al. (2019): the model is provided an approximation to the topic at test time, in the form of a bag of on-topic words \(\mathcal{W}\). The goal is to sample text according to the topic approximated by \(\mathcal{W}\), starting from a generic prefix. There are 7 topics (space, politics, military, legal, science, religion, and computers) and 20 prefixes, and the model generates 3 80-token7 samples from each topic-prefix pair, for a total of 420 generations.

Footnote 7: All models and baselines use GPT2 tokenization.

**Metrics**. Unfortunately, we cannot easily construct a rule-based \(\mathcal{F}\) for being "on-topic." Additionally, use rate of words in \(\mathcal{W}\) is a poor metric, because a model can score highly by e.g., simply returning the words in \(\mathcal{W}\), without generalizing to the full topic that \(\mathcal{W}\) approximates. Instead, we adopt a notion of success which requires the model to generalize the bag \(\mathcal{W}\) to the full topic. The remaining metrics are measures of quality and diversity.

1. _Success_, the average number of distinct words in a heldout bag \(\mathcal{W^{\prime}}\) which appear in the model output. Specifically, for each word in \(\mathcal{W}\), we add to \(\mathcal{W^{\prime}}\) the closest GloVe Pennington et al. (2014) word by cosine similarity, such that the new word does not contain (and is not contained by) any word in \(\mathcal{W}\). (This excludes e.g., most plurals.) Usage of distinct words in \(\mathcal{W^{\prime}}\) measures the model's ability to generalize \(\mathcal{W}\) to other on-topic words, of which \(\mathcal{W^{\prime}}\) is a non-exhaustive set. This is our main metric.
2. _Grammaticality_, identical to the couplet task.
3. _Perplexity_, identical to the couplet task.
4. _Distinctness_, defined as in the couplet task. However, it is calculated separately within the 60 generations for each topic, and then averaged over the 7 topics.

Additionally, following the evaluation procedure of prior work such as Dathathri et al. (2019), we run human evaluations via Amazon Mechanical Turk for Fudge against each baseline, comparing topic control and fluency. For each pairwise comparison, we ask 3 workers to evaluate each of 420 paired outputs. Workers were asked to mark which generation is more on topic (first, second, both, or neither), and to rate each generation's fluency on a Likert scale from 1 to 5. We report the average fraction of outputs marked as on-topic as well as the average fluency rating for each method.

#### 4.2.1 Method and Baselines

**Fudge Instantiation.** Since we model topics as bags of words, Fudge uses a binary predictor \(\mathcal{B}(x_{1:i},w)\) which takes a prefix \(x_{1:i}\) and word \(w\), and classifies whether \(w\) appears in the future \(x_{i:n}\) for \(n\geq i\). (Since it is desirable to _stay_ on topic even after successfully _getting_ on topic, we use \(x_{i:n}\) rather than \(x_{1:n}\).) Training examples \((x_{1:i},w)\) are sampled from the same dataset of 10 million GPT2-Medium generations used for the couplet task, and \(\mathcal{B}\) is trained using noise-contrastive estimation. \(\mathcal{B}\)

\begin{table}
\begin{tabular}{l} \hline And even thence thou wilt bet solt’n, I fear, \\ for this shall be the end. That’s pretty clear. \\ \hline Or, if they sleep, thy picture in my sight \\ I will be glad to look upon the night. \\ \hline \end{tabular}
\end{table}
Table 3: Two examples of successful couplet completions (in purple) generated by Fudge.

 

is a lightweight LSTM-based classifier similar to \({\cal B}_{2}\) from the couplet task.

At test time, we can compose individual-word constraints if we assume conditional independence between words (although this may be imperfect). Given a bag of \(N\) words \(\{w_{1}\ldots w_{N}\}\) and prefix \(x_{1:i}\), we could condition on all words in the bag appearing in the future by adding all log-probabilities \(\log P(w_{1}|x_{1:i})\ldots\log P(w_{N}|x_{1:i})\) to \({\cal G}\)'s logits. However, topic control does not require every word to appear; perhaps some number \(\lambda\) of on-topic words is enough to be "on-topic." Therefore, we model the topic constraint as selecting a random subset of \(\lambda\) words from the original bag, and requiring that only those \(\lambda\) words all appear. Since each of the \(N\) words is selected with probability \(\frac{\lambda}{N}\), the quantity we add to the base \({\cal G}\) logits is \(\frac{\lambda}{N}\sum_{j=1}^{N}\log P(w_{j}|x_{1:i})\) in expectation. In our experiments we use \(\lambda=4\), based on a fantasy-topic bag of words used for validation (Appendix C).

**Baselines.** We compare to four baselines.

1. \({\cal G}\), the original GPT2-Medium.
2. Finetune, which finetunes \({\cal G}\) on the same inputs used for Fudge. The future word is given as a prefix for conditioning. At test time, we compute logits for each prefix in the given \({\cal W}\) and use the average as the true logits, as an ad hoc way to condition on the full \({\cal W}\).
3. Wdec, a simple weighted decoding implementation which greedily considers only the immediate next token when optimizing for \(a\). Instead of using \({\cal B}\), Wdec just adds a fixed \(\lambda_{\textsc{Wdec}}\) to the logit for each word in \({\cal W}\). Note Wdec requires \(a\) to be well-defined at the token level, so it is not easily transferable to certain tasks (e.g., couplet completion).
4. Pplm[7], which modifies the activations of \({\cal G}\) to make the desired bag of words more likely at the immediate next position. We use their method without reranking for fair comparison.

All methods use top-\(k\) sampling with \(k=10\), following Dathathri et al.Dathathri et al. (2019)'s setup.

#### Results

Fudge achieves the highest success by a substantial margin (Table 4), and outperforms all baselines on human evaluations in both topic relevance and fluency (Table 5). Fudge simultaneously preserves high quality and diversity according to automated metrics. Table 6 shows two examples.

Unsurprisingly, \({\cal G}\) performs poorly on success. Wdec and Finetune also perform poorly, in success and especially in distinctness. Wdec frequently degenerates into repeating the given words in the bag \({\cal W}\), despite tuning \(\lambda_{\textsc{Wdec}}\) (Appendix C).

\begin{table}
\begin{tabular}{l c c c c c c} \hline \hline  & _On-Topic_ & \multicolumn{3}{c}{_Text Quality_} & \multicolumn{3}{c}{_Diversity_} \\ \cline{2-8} Method & **Success**\(\uparrow\) & Grammar \(\uparrow\) & Perplexity \(\downarrow\) & Dist-1 \(\uparrow\) & Dist-2 \(\uparrow\) & Dist-3 \(\uparrow\) \\ \hline \({\cal G}\) & 0.22 & 0.81 & 37.1 \(\pm\) 26.9 & 0.35 & 0.78 & 0.92 \\ Finetune & 0.28 & 0.74 & 24.9 \(\pm\) 13.7 & 0.29 & 0.70 & 0.88 \\ WDec & 0.14 & 0.59 & 33.8 \(\pm\) 33.7 & 0.16 & 0.42 & 0.55 \\ Pplm & 0.48 & 0.78 & 43.1 \(\pm\) 23.7 & 0.35 & 0.78 & 0.92 \\ Fudge & **0.59** & 0.79 & 40.7 \(\pm\) 26.3 & 0.34 & 0.75 & 0.91 \\ \hline \hline \end{tabular}
\end{table}
Table 4: Topic control results. Success (main metric), grammaticality, perplexity, and distinctness for different methods. Finetune and Wdec often degenerate into repeating the given bag of words \({\cal W}\); this is ill-captured by perplexity, but results in poor grammaticality and distinctness. Fudge substantially outperforms all baselines on success, including the strong gradient-based Pplm baseline, while preserving high quality and diversity.

\begin{table}
\begin{tabular}{l l l} \hline \hline
**Method** & **Topic** & **Fluency** \\ \hline \({\cal G}\) & 0.16 & 4.11 \\ Fudge & **0.78** & **4.30** \\ \hline Finetune & 0.24 & 3.95 \\ Fudge & **0.76** & **4.22** \\ \hline Wdec & 0.49 & 2.50 \\ Fudge & **0.75** & **4.21** \\ \hline Polym & 0.45 & 4.05 \\ Fudge & **0.74** & **4.16** \\ \hline \hline \end{tabular}
\end{table}
Table 5: Topic control human evaluations, pairwise comparisons. Fudge achieves a substantially higher fraction of on-topic outputs compared to each baseline, in addition to higher average fluency (rated 1 to 5).

 



**Space:** The issue focused on the original plot, which was about a mysterious ship that would land on Earth, and would lead to humanity's first interstellar expedition. The original plan called for humanity to use the spacecraft to colonize outer space and build the first city on Mars. But this idea fell by the wayside in the final drafts.nun"It was just not a very popular idea and it wasn'

**Politics:** The issue focused on whether the two institutions were operating within the bounds set by the constitution and the law.ruinThe Constitutional Court said that both governments "have a duty to ensure the integrity of the electoral process and its effective administration, especially in light of the current political climate that is threatening the functioning of elections"

Finetune also suffers from repetition, which appears to be the result of distribution shift from fine-tuning. Our fine-tuning dataset was built by sampling directly from the original \(P(X)\) modeled by \({\cal G}\) to mitigate distribution shift, but it is well-known that language model generations are more repetitive than natural language Holtzman et al. (2018, 2019). We hypothesize that Finetune, being fine-tuned on language model generations rather than natural language, amplifies this repetitiveness. This repetition is reflected in the poor grammaticality for both Finetune and especially Wdec. In contrast, Fudge does not touch the original \(P(X)\), largely avoiding Finetune's distribution shift problem on this task.

Finally, Fudge outperforms the strong gradient-based Pplm method, despite requiring access only to \({\cal G}\)'s output logits. Non-reliance on gradients means Fudge is also many times faster than Pplm, which takes a few hours compared to Fudge's 15 minutes for the full set of 420 generations on our hardware. Sometimes we do not even have gradients: for example, gradients are unavailable in the API for GPT3 at time of writing.

### Machine Translation Formality Change

Finally, we turn to a somewhat more challenging task, changing formality in machine translation -- specifically, from informal to formal. Given a source sentence written in an informal and conversational style, the goal is to output a translation which is also more formal. We test on the Fisher and CALLHOME Spanish-English Speech Translation Corpus Post et al. (2013), a collection of transcribed Spanish conversations with English translations. Both the source Spanish and target English are highly informal and disfluent Salesky et al. (2019) augment the Fisher dataset with additional parallel English translations, rewritten to be more fluent (and hence more formal); see Table 7 for an example. Our task is to translate the original informal Spanish to into more formal English. However, we assume that Salesky et al. (2019)'s fluent references are unavailable during training.

**Metrics.** The desired attribute \(a\) is formality, but we cannot sacrifice the source sentence's meaning. The latter requirement makes generation more constrained than in the couplet and topic tasks, so perplexity and distinctness are less relevant. Instead, we use the following:

* _BLEU Score_Papineni et al. (2002), using two of Salesky et al. (2019)'s fluent references per test example. This is our main metric.
* _Formality_, the average probability that the model's outputs are formal, according to an evaluator trained on the Family/Relationship domain of the GYAFC formality dataset Rao and Tetreault (2018). The evaluator is an LSTM followed by a linear layer.

#### 4.3.1 Method and Baselines

**Fudge Instantiation.** We assume that the attribute \(a\), formality, is conditionally independent from the original conditioning in \({\cal G}\), i.e., the meaning of the Spanish input. Fudge uses a binary predictor \({\cal B}(x_{1:n})\) which classifies whether the text starting with prefix \(x_{1:n}\) is written in a formal style. \({\cal B}\) is an LSTM followed by a linear layer, trained on the Entertainment/Music domain of GYAFC.

At test time, Fudge directly augments \({\cal G}\)'s logits using log-probabilities from \({\cal B}\). \({\cal G}\) is a pretrained Marian Junczys-Dowmunt et al. (2018)

\begin{table}
\begin{tabular}{p{260.0pt}} \hline \hline
**Space:** The issue focused on the original plot, which was about a mysterious ship that would land on Earth, and would lead to humanity’s first interstellar expedition. The original plan called for humanity to use the spacecraft to colonize outer space and build the first city on Mars. But this idea fell by the wayside in the final drafts.nun”It was just not a very popular idea and it wasn’ \\ \hline
**Politics:** The issue focused on whether the two institutions were operating within the bounds set by the constitution and the law.ruinThe Constitutional Court said that both governments “have a duty to ensure the integrity of the electoral process and its effective administration, especially in light of the current political climate that is threatening the functioning of elections” \\ \hline \hline  & \\ \end{tabular}
\end{table}
Table 6: The first output from Fudge when using the prefix “The issue focused on” for two topics. We use red to highlight words in the given bag of words \({\cal W}\) along with obvious forms (e.g., plurals), and cyan for other on-topic words, including related words not in the heldout bag \({\cal W}^{\prime}\). More examples in Appendix J.



transformer model for Spanish-English. We evaluate both when \({\cal G}\) is fine-tuned on the original Fisher training dataset (i.e., using the original targets, not Salesky et al. (2019)'s more fluent targets) as well as zero-shot with no fine-tuning, which is challenging due to the highly informal and disfluent text.

**Baselines.** We compare to two baselines.

1. \({\cal G}\), the original machine translation model.
2. \({\cal G+st}\), a pipeline consisting of \({\cal G}\) followed by a style transfer model. Our style transfer model is T5Raffel et al. (2020), fine-tuned on the same GYAFC Entertainment/Music domain that we used to train \({\cal B}\) in Fudge.

Since we do not assume access to Salesky et al. (2019)'s more formal targets during training, it is difficult to apply Pplm to this task: Pplm's predictor would operate on the pretrained translation model's hidden states, thus requiring a Spanish-English translation dataset with both formal and informal English.8 We omit Finetune for the same reason. In contrast, Fudge requires only the original English dataset with formality annotations.

Footnote 8: We nevertheless ran Pplm in a somewhat convoluted setup, but found that it performed poorly (Appendix B).

All methods use greedy decoding.

#### 4.3.2 Results

As shown in Table 8, Fudge increases the formality of outputs compared to \({\cal G}\), even though the test-time formality predictor is trained on a different domain (Family/Relationships, rather than Entertainment/Music). Note that formality unsurprisingly decreases after fine-tuning \({\cal G}\), simply due to the informality of the fine-tuning dataset. As in the couplet task, one could adjust the strength of the formality control in Fudge, although this is unprinciped from the view of modeling \(P(X|a)\).

Moreover, while Fudge and \({\cal G}\) achieve similar BLEU after fine-tuning \({\cal G}\), Fudge achieves higher BLEU compared to \({\cal G}\) when \({\cal G}\) is not fine-tuned on the Fisher training set. In the latter case, controlling for formality somewhat remedies the struggles of \({\cal G}\) when not fine-tuned on such disfluent text.

In contrast, the \({\cal G+st}\) baseline achieves nearperfect formality but less than half the BLEU of \({\cal G}\), due to the style transfer model overfitting to the GYAFC Entertainment/Music dataset. This is similar to the distribution shift issue that we observed in topic control for Finetune, an issue which Fudge largely avoids. Nevertheless, there remains substantial room for improvement on this difficult task.

## 5 Discussion

Fudge is a principled approach to controlled text generation which models \(P(X|a)\) by closely following a Bayesian factorization, thus preserving the base \(P(X)\) as much as possible. Fudge achieves strong performance on a wide range of different tasks: poetry couplet completion, topic control, and informal-to-formal machine translation. Additionally, Fudge can easily compose different attributes in a modular fashion: the meter, rhyme, and end-of-sentence constraints for couplet completion, and the individual words within each topic bag for topic control. In principle, Fudge is applicable to any controlled generation task where we can train discriminators for the desired attribute or attributes.

\begin{table}
\begin{tabular}{l r r r r} \hline \hline  & \multicolumn{2}{c}{\({\cal G}\)_(No fine-tune)_} & \multicolumn{2}{c}{\({\cal G}\)_(Fine-tune)_} \\ Method & **BLEU**\(\uparrow\) & Form. \(\uparrow\) & **BLEU**\(\uparrow\) & Form. \(\uparrow\) \\ \cline{2-4} \({\cal G}\) & 16.98 & 0.45 & **22.03** & 0.41 \\ \({\cal G}\) + st & 7.87 & 0.96 & 9.63 & 0.97 \\ Fudge & **17.96** & 0.51 & **22.18** & 0.48 \\ \hline \hline \end{tabular}
\end{table}
Table 8: Machine translation formality results. BLEU (main metric) and average formality for different methods, with and without fine-tuning \({\cal G}\) on the Fisher domain. Fudge increases the formality of translations compared to the base model \({\cal G}\) while preserving or increasing BLEU score. Conversely, \({\cal G}\) with style transfer overfits to the formality data, resulting in near-perfect formality but losing the original meaning.

\begin{table}
\begin{tabular}{l l} \hline \hline Spanish & que era lo que tenía que tienes que hacer \\ \({\cal G}\) & that was what you had to do \\ Fudge & That was what you had to do \\ Reference & What’s there to do? \\ \hline Spanish & ah en mi en inglaterra por ejemplo \\ \({\cal G}\) & Ah, in my, in England, for example. \\ Fudge & Ah, in England, for example. \\ Reference & In England, for example? \\ \hline \hline \end{tabular}
\end{table}
Table 9: Example translations by \({\cal G}\) (fine-tuned on the Fisher dataset) and Fudge using the same \({\cal G}\). Original Spanish and Salesky et al. (2019) references also shown. In this setting, Fudge achieves similar BLEU to \({\cal G}\) while increasing formality. While Fudge often simply corrects punctuation or capitalization (top), it also makes more complex adjustments (bottom). More examples in Appendix L.

 

Ethics of Controlled Text Generation

We recognize that strong controlled generation methods have the potential to produce harmful outputs and/or misinformation when used adversarially (Wallace et al., 2019, Wallace et al., 2020). However, such methods can also be a powerful tool for mitigating harmful biases learned by large pretrained language models (Radford et al., 2019; Brown et al., 2020), for example by detoxifying language (Dathathri et al., 2019; Krause et al., 2020). Overall, we believe it is still beneficial to continue research into general controlled text generation methods such as Fudge.

## Acknowledgements

We thank Daniel Fried, David Gaddy, Eric Wallace, Kevin Lin, Nicholas Tomlin, Ruiqi Zhong, and the three anonymous reviewers for their helpful comments and feedback, which aided us in greatly improving the paper. We also thank the authors of Dathathri et al. (2019) for clarifying our questions about their topic control setup. This work was supported by Berkeley AI Research, DARPA under agreement HR00112020054, and the NSF through a fellowship to the first author. The content does not necessarily reflect the position or the policy of the government, and no official endorsement should be inferred.

## References

* Brown et al. (2020)Tom B Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. 2020. Language models are few-shot learners. _arXiv preprint arXiv:2005.14165_.
* Cohn-Gordon et al. (2018)Reuben Cohn-Gordon, Noah Goodman, and Christopher Potts. 2018. Pragmatically informative image captioning with character-level inference. _arXiv preprint arXiv:1804.05417_.
* Dai et al. (2019a) Ning Dai, Jianze Liang, Xipeng Qiu, and Xuanjing Huang. 2019a. Style transformer: Unpaired text style transfer without disentangled latent representation. _arXiv preprint arXiv:1905.05621_.
* Dai et al. (2019b)Zihang Dai, Zhilin Yang, Yiming Yang, Jaime Carbonell, Quoc V Le, and Ruslan Salakhutdinov. 2019b. Transformer-xl: Attentive language models beyond a fixed-length context. _arXiv preprint arXiv:1901.02860_.
* Dathathri et al. (2019)Sumanth Dathathri, Andrea Madotto, Janice Lan, Jane Hung, Eric Frank, Piero Molino, Jason Yosinski, and Rosanne Liu. 2019. Plug and play language models: a simple approach to controlled text generation. _arXiv preprint arXiv:1912.02164_.
* Ficler and Goldberg (2017)Jessica Ficler and Yoav Goldberg. 2017. Controlling linguistic style aspects in neural language generation. _arXiv preprint arXiv:1707.02633_.
* Gehrmann et al. (2018)Sebastian Gehrmann, Yuntian Deng, and Alexander M Rush. 2018. Bottom-up abstractive summarization. _arXiv preprint arXiv:1808.10792_.
* Ghazvininejad et al. (2016)Marian Ghazvininejad, Xing Shi, Yejin Choi, and Kevin Knight. 2016. Generating topical poetry. In _Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing_, pages 1183-1191.
* Ghazvininejad et al. (2017)Marjan Ghazvininejad, Xing Shi, Jay Priyadarshi, and Kevin Knight. 2017. Hafez: an interactive poetry generation system. In _Proceedings of ACL 2017, System Demonstrations_, pages 43-48.
* Gutmann and Hyvarinen (2010)Michael Gutmann and Aapo Hyvarinen. 2010. Noise-contrastive estimation: A new estimation principle for unnormalized statistical models. In _Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics_, pages 297-304.
* Holtzman et al. (2019)Ari Holtzman, Jan Buys, Li Du, Maxwell Forbes, and Yejin Choi. 2019. The curious case of neural text degeneration. _arXiv preprint arXiv:1904.09751_.
* Holtzman et al. (2018)Ari Holtzman, Jan Buys, Maxwell Forbes, Antoine Bosseltu, David Golub, and Yejin Choi. 2018. Learning to write with cooperative discriminators. _arXiv preprint arXiv:1805.06087_.
* Hu et al. (2017)Zhiting Hu, Zichao Yang, Xiaodan Liang, Ruslan Salakhutdinov, and Eric P Xing. 2017. Toward controlled generation of text. _arXiv preprint arXiv:1703.00955_.
* John et al. (2018)Vineet John, Lili Mou, Hareesh Bahuleyan, and Olga Vechtomova. 2018. Disentangled representation learning for non-parallel text style transfer. _arXiv preprint arXiv:1808.04339_.
* Junczys-Dowmunt et al. (2018)Marcin Junczys-Dowmunt, Roman Grundkiewicz, Tomasz Dwojak, Hieu Hoang, Kenneth Heafield, Tom Neckermann, Frank Seide, Ulrich Germann, Aham Fitzi Aji, Nikolay Bogoychev, et al. 2018. Marian: Fast neural machine translation in c++. _arXiv preprint arXiv:1804.00344_.
* Keskar et al. (2019)Nitish Shirish Keskar, Bryan McCann, Lav R Varshney, Caiming Xiong, and Richard Socher. 2019. Ctrl: A conditional transformer language model for controllable generation. _arXiv preprint arXiv:1909.05858_.
* Krause et al. (2020)Ben Krause, Akhilesh Deepak Gottmare, Bryan McCann, Nitish Shirish Keskar, Shafiq Joty, Richard Socher, and Nazneen Fatema Rajani. 2020. Gedi: Generative discriminator guided sequence generation. _arXiv preprint arXiv:2009.06367_ 

Guillaume Lample, Myle Ott, Alexis Conneau, Ludovic Denoyer, and Marc'Aurelio Ranzato. 2018a. Phrase-based & neural unsupervised machine translation. _arXiv preprint arXiv:1804.07755_.
* Lample et al. (2018b) Guillaume Lample, Sandeep Subramanian, Eric Smith, Ludovic Denoyer, Marc'Aurelio Ranzato, and YLan Boureau. 2018b. Multiple-attribute text rewriting. In _International Conference on Learning Representations_.
* Lau et al. (2018) Jey Han Lau, Trevor Cohn, Timothy Baldwin, Julian Brooke, and Adam Hammond. 2018. Deep-sparex: A joint neural model of poetic language, meter and rhyme. _arXiv preprint arXiv:1807.03491_.
* Lazaridou et al. (2020) Angeliki Lazaridou, Anna Potapenko, and Olivier Tieleman. 2020. Multi-agent communication meets natural language: Synergies between functional and structural language learning. _arXiv preprint arXiv:2005.07064_.
* Lewis et al. (2019) Mike Lewis, Yinhan Liu, Naman Goyal, Marjan Ghazvininejad, Abdelrahman Mohamed, Omer Levy, Ves Stoyanov, and Luke Zettlemoyer. 2019. Bart: Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension. _arXiv preprint arXiv:1910.13461_.
* Li et al. (2015) Jiwei Li, Michel Galley, Chris Brockett, Jianfeng Gao, and Bill Dolan. 2015. A diversity-promoting objective function for neural conversation models. _arXiv preprint arXiv:1510.03055_.
* Liu et al. (2020) Ruibo Liu, Guangxuan Xu, Chenyan Jia, Weicheng Ma, Lili Wang, and Soroush Vosoughi. 2020. Data boost: Text data augmentation through reinforcement learning guided conditional generation. In _Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)_, pages 9031-9041.
* Liu et al. (2019) Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. 2019. Roberta: A robustly optimized bert pretraining approach. _arXiv preprint arXiv:1907.11692_.
* Ng et al. (2019) Nathan Ng, Kyra Yee, Alexei Baevski, Myle Ott, Michael Auli, and Sergey Edunov. 2019. Facebook fair's wmtt19 news translation task submission. _arXiv preprint arXiv:1907.06616_.
* Papineni et al. (2002) Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu. 2002. Bleu: a method for automatic evaluation of machine translation. In _Proceedings of the 40th annual meeting of the Association for Computational Linguistics_, pages 311-318.
* Paszke et al. (2019) Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, et al. 2019. Pytorch: An imperative style, high-performance deep learning library. In _Advances in neural information processing systems_, pages 8026-8037.
* Pennington et al. (2014) Jeffrey Pennington, Richard Socher, and Christopher D Manning. 2014. Glove: Global vectors for word representation. In _Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP)_, pages 1532-1543.
* Post et al. (2013) Matt Post, Gaurav Kumar, Adam Lopez, Damianos Karakos, Chris Callison-Burch, and Sanjeev Khudanpur. 2013. Improved speech-to-text translation with the fisher and callhome spanish-english speech translation corpus. In _Proc. IWSLT_.
* Radford et al. (2018) Alec Radford, Karthik Narasimhan, Tim Salimans, and Ilya Sutskever. 2018. Improving language understanding by generative pre-training.
* Radford et al. (2019) Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. 2019. Language models are unsupervised multitask learners. _OpenAI blog_, 1(8):9.
* Raffel et al. (2020) Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqj Zhou, Wei Li, and Peter J. Liu. 2020. Exploring the limits of transfer learning with a unified text-to-text transformer. _Journal of Machine Learning Research_, 21(140):1-67.
* Rao and Tetreault (2018) Sudha Rao and Joel Tetreault. 2018. Dear sir or madam, may i introduce the gyafc dataset: Corpus, benchmarks and metrics for formality style transfer. _arXiv preprint arXiv:1803.06535_.
* Salesky et al. (2019) Elizabeth Salesky, Matthias Sperber, and Alex Waibel. 2019. Fluent translations from disfluent speech in end-to-end speech translation. _arXiv preprint arXiv:1906.00556_.
* See et al. (2017)bigail See, Peter J Liu, and Christopher D Manning. 2017. Get to the point: Summarization with pointer-generator networks. _arXiv preprint arXiv:1704.04368_.
* See et al. (2019)Bigail See, Stephen Roller, Douwe Kiela, and Jason Weston. 2019. What makes a good conversation? how controllable attributes affect human judgments. _arXiv preprint arXiv:1902.08654_.
* Shen et al. (2019) Sheng Shen, Daniel Fried, Jacob Andreas, and Dan Klein. 2019. Pragratically informative text generation. _arXiv preprint arXiv:1904.01301_.
* Subramani et al. (2019) Nishant Subramani, Samuel Bowman, and Kyunghyun Cho. 2019. Can unconditional language models recover arbitrary sentences? In _Advances in Neural Information Processing Systems_, pages 15258-15268.
* Wallace et al. (2019) Eric Wallace, Shi Feng, Nikhil Kandpal, Matt Gardner, and Sameer Singh. 2019. Universal adversarial triggers for attacking and analyzing nlp. _arXiv preprint arXiv:1908.07125_.
* Wallace et al. (2020) Eric Wallace, Mitchell Stern, and Dawn Song. 2020. Imitation attacks and defenses for blackbox machine translation systems. _arXiv preprint arXiv:2004.15015_.

 

Qixin Wang, Tianyi Luo, Dong Wang, and Chao Xing. 2016. Chinese song iambics generation with neural attention-based model. _arXiv preprint arXiv:1604.06274_.
* Warstadt et al. (2019) Alex Warstadt, Amanpreet Singh, and Samuel R Bowman. 2019. Neural network acceptability judgments. _Transactions of the Association for Computational Linguistics_, 7:625-641.
* Weide (1998) Robert L Weide. 1998. The cmu pronouncing dictionary. _URL: http://www. speech. cs. cmu. edu/cigbin/cmudict_.
* Wolf et al. (2019) Thomas Wolf, Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Pierric Cistac, Tim Rault, Remi Louf, Morgan Funtowicz, et al. 2019. Huggingface's transformers: State-of-the-art natural language processing. _ArXiv_, pages arXiv-1910.
* Yu et al. (2017) Lantao Yu, Weinan Zhang, Jun Wang, and Yong Yu. 2017. Seqgan: Sequence generative adversarial nets with policy gradient. In _Thirty-first AAAI conference on artificial intelligence_.
* Zaheer et al. (2020) Manzil Zaheer, Guru Guruganesh, Avinava Dubey, Joshua Ainslie, Chris Alberti, Santiago Ontanon, Philip Pham, Anirudh Ravula, Qifan Wang, Li Yang, et al. 2020. Big bird: Transformers for longer sequences. _arXiv preprint arXiv:2007.14062_.
* Zhang and Lapata (2014) Xingxing Zhang and Mirella Lapata. 2014. Chinese poetry generation with recurrent neural networks. In _Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)_, pages 670-680.
* Ziegler et al. (2019) Daniel M Ziegler, Nisan Stiennon, Jeffrey Wu, Tom B Brown, Alec Radford, Dario Amodei, Paul Christiano, and Geoffrey Irving. 2019. Fine-tuning language models from human preferences. _arXiv preprint arXiv:1909.08593_.

 

Details of \({\cal F}\) for Couplet Completion

We provide the full details of the function \({\cal F}\) we use to check iambic pentameter, rhyme, and sentence-ending in our couplet completion task. Note that iambic pentameter consists of two components: iambic meter as well as containing exactly ten syllables.

1. _Iambic meter:_ Given a phrase, we obtain the sequence of stresses (0 for unstressed, 1 for stressed, 2 for secondary stress) for each word, according to the CMU Pronouncing Dictionary [35]. If any word does not exist in the dictionary (almost never for non-Shakespeare methods) we return False. We treat 2 as ambiguous stress, and additionally change 1 to 2 for any monosyllabic words, i.e. we allow monosyllabic stressed words to be unstressed but not vice versa. Finally, we check that all syllables at even indices (0-indexed) are unstressed or ambiguous, and all syllables at odd indices are stressed or ambiguous.
2. _Number of syllables:_ We count the number of syllables in each word based on the number of stresses according to the CMU Pronouncing Dictionary. If a word does not exist in the dictionary, we estimate the number of syllables by rounding the number of letters divided by 3 to the nearest integer.
3. _Rhyme:_ Two words rhyme if and only if they both exist in the CMU Pronouncing Dictionary and are a perfect rhyme according to the dictionary.
4. _Sentence-ending:_ We check if the output ends with a period, question mark, or exclamation mark.

Of course, both Fudge and Finetune will fit to whatever output is given by \({\cal F}\). The purpose of the couplet task is to check Fudge's ability to fit a difficult well-formedness constraint. We simply design an \({\cal F}\) that corresponds to true iambic pentameter rhymes in most cases.

### Shakespeare Evaluation

Shakespeare himself performs somewhat poorly according to \({\cal F}\), which is designed with the automated baselines in mind, not for Shakespeare. (The same is true for our grammaticality and perplexity metrics.)

One source of error is words which are out-of-vocabulary for the CMU Pronouncing Dictionary. Such words are almost never generated by either Fudge or our automated baselines, but appear in a fifth of Shakespeare's lines, resulting in failures on the iambic meter and syllable checks.

Nevertheless, most of Shakespeare's "errors" are the result of real -- though slight -- deviations from our very strict definitions of meter and rhyme. In particular, he frequently (1) elides syllables to fit meter, and (2) uses loose rhymes; both "error" types are likely exacerbated by differences between archaic and modern pronunciations. The example in Table 10 illustrates both types of "errors." Although such deviations are often acceptable to a human, they are difficult to capture in an automatic metric, and we do not allow such deviations in \({\cal F}\). Again, Shakespeare is only included as a whimsical point of reference, and not as a serious baseline to be compared to.

## Appendix B Pplm Baseline in Machine Translation

As discussed in the main text, it is difficult to apply Pplm in our machine translation setup, in which \(P(a|X)\) is learned from an English formality dataset without parallel Spanish. Since \(P(X)\) is a Spanish-English translation model, we must obtain hidden states for training Pplm's \(P(a|X)\) by first "backtranslating" English into Spanish, accessing a second pretrained translator. For this purpose we use a second pretrained Marian transformer from HuggingFace ([https://huggingface.co/Helsinki-NLP/opus-mt-en-es](https://huggingface.co/Helsinki-NLP/opus-mt-en-es)). Additionally, we needed to tune their suggested hyperparameters.

During evaluation, we observe that Pplm makes some reasonable modifications for formality compared to the base \(P(X)\), like changing "hard" to "difficult," but such improvements are also accompanied by occasional disfluencies and/or repetitions (although such problems plague all methods to

\begin{table}
\begin{tabular}{p{86.7pt}} \hline But here’s the joy; my friend and I are one; Sweet flattery! then she loves but me alone. \\ \hline \end{tabular}
\end{table}
Table 10: An example couplet by William Shakespeare, illustrating two common deviations from the narrow definition of correctness we use in \({\cal F}\). For this example to follow iambic meter, one must read “flattery” in only two syllables. Moreover, “one/alone” is a loose (non-perfect) rhyme, at least in modern English.

 

some degree). Overall, while Pplm achieves similar BLEU to Fudge, it is substantially less formal (Table 11).

## Appendix C Hyperparameter Choices

Fudge has essentially one hyperparameter in our topic control task, \(\lambda\), which controls the strength of conditioning and corresponds to the number of words in the bag which should appear in the future.

To choose \(\lambda\) in topic control, we used a separate validation bag of words (on the topic of fantasy; Appendix K.4) to select a reasonable \(\lambda\) for our main paper experiments (\(\lambda=4\)). Unlike in the main paper where we use heldout bags \({\cal W}^{\prime}\) to measure success, during validation we simply use the original bag. We use a set of 60 generations, considering values ranging from 1 to 6 (Table 12), although the result may be somewhat noisy. Of course, different choices of \(\lambda\) result in different tradeoffs (Appendix G).

We also optimized the conditioning strength \(\lambda_{\text{Wdec}}\) for the Wdec baseline on the same fantasy bag of words, considering values ranging from 1 to 32. We selected the only value (4) which achieved reasonable success without a total collapse in diversity (Table 13), but diversity still collapsed when tested on our seven main test bags of words.

We do not optimize any model hyperparameters in the couplet completion and informal-to-formal translation tasks. LSTM's and feedforward networks are 3 layers (including the output layer of dimension 1) and 300-dimensional unless otherwise specified. They are bidirectional (150-dimensional in each direction) for the couplet rhyme predictor and the topic control future words predictor, and otherwise unidirectional. Attention mechanisms use key-query-value attention. For the rhyme and future words predictors the output hidden state is multiplied element-wise by the embedding of the rhyme sound or future word, then concatenated to the embeddings, before the final feedforward network. Since a selling point of our method is the lightweight process of constructing and training predictors, noise-contrastive estimation is a natural choice for the rhyme and future word predictors: we avoid softmaxing over the output dimension during training. (This is primarily relevant for the future word predictor, as the number of distinct rhyme sounds is not too large, but we use noise-contrastive estimation for both for consistency's sake.)

For the Pplm baseline, we used step size 0.01 for both couplet completion and MT after tuning, and kept their other hyperparameters fixed. For topic control we simply evaluated their provided generations instead of rerunning their model.

## Appendix D Ablations on Predictor Architectures

Some variation in predictor architectures is necessary due to the diversity of our tasks (as evidenced by the difficulties in adapting PPLM). Specifically, while our core predictor architecture is word embeddings followed by LSTM and output layer, task-specific architectures vary because some "predictors" are actually families of related predictors. We model such families as a single predictor taking additional input (e.g., rhyme sound in poetry); this is needed in our poetry and topic tasks.

On these two tasks, we provide ablations with more homogenized predictors: additional inputs are simply embedded and concatenated to each input word embedding. The difference is relatively small in both cases (Tables 14 and 15). FudgeMod indicates the ablated version of Fudge.

## Appendix E Alternative Perplexity Measurements

On the couplet completion task, we additionally measure perplexity using Transformer-XL Dai et al. (2019b) and using a GPT model fine-tuned on Shakespeare language as generated by Lau et al. (2018). We measure using Transformer-XL on the topic control task as well. Relative complexities between most models remain largely similar when switching between GPT and Transformer-XL, with a few exceptions. Compared to the base GPT, Shakespeare's perplexity naturally decreases while other models' perplexities increase when measured with Shakespeare-finetuned GPT. The highly repetitive and disfluent Wdecbaseline is rightly punished for this behavior when measured by Transformer-XL. Pplm also obtains slightly lower perplexity than Fudge on topic control when

\begin{table}
\begin{tabular}{l c c} \hline \hline  & \multicolumn{2}{c}{\(\mathcal{G}\) **(Fine-tune)**} \\ Method & **BLEU**\(\uparrow\) & Form. \(\uparrow\) \\ \hline Pplm & 21.94 & 0.40 \\ Fudge & 22.18 & 0.48 \\ \hline \hline \end{tabular}
\end{table}
Table 11: Pplm baseline in machine translation formality on the fine-tuned \(\mathcal{G}\).

 



\begin{table}
\begin{tabular}{l c c c c c c} \hline \hline  & _Conferences_ & \multicolumn{3}{c}{_Text Quality_} & \multicolumn{2}{c}{_Diversity_} \\ \cline{2-7} Method & **Success \(\uparrow\)** & Grammar \(\uparrow\) & Perplexity \(\downarrow\) & Dist-1 \(\uparrow\) & Dist-2 \(\uparrow\) & Dist-3 \(\uparrow\) \\ \cline{2-6} \cline{8-9} Fudge & 0.44 & 0.44 & 70.9 \(\pm\) 89.4 & 0.40 & 0.79 & 0.78 \\ FudgeMod & 0.39 & 0.43 & 72.1 \(\pm\) 66.3 & 0.41 & 0.79 & 0.77 \\ \hline \hline \end{tabular}
\end{table}
Table 14: Ablation of Fudge with a modified predictor architecture on couplet completion.

\begin{table}
\begin{tabular}{l l c c c c c} \hline \hline  & _On-Topic_ & \multicolumn{3}{c}{_Text Quality_} & \multicolumn{3}{c}{_Diversity_} \\ \cline{2-7} Method & **Success \(\uparrow\)** & Grammar \(\uparrow\) & Perplexity \(\downarrow\) & Dist-1 \(\uparrow\) & Dist-2 \(\uparrow\) & Dist-3 \(\uparrow\) \\ \hline Fudge, \(\lambda=1\) & 0.05 & 0.80 & 38.3 \(\pm\) 32.6 & 0.36 & 0.78 & 0.92 \\ Fudge, \(\lambda=2\) & 0.10 & 0.76 & 31.1 \(\pm\) 17.1 & 0.35 & 0.75 & 0.91 \\ Fudge, \(\lambda=4\) & 0.28 & 0.76 & 40.1 \(\pm\) 27.6 & 0.37 & 0.77 & 0.92 \\ Fudge, \(\lambda=6\) & 0.30 & 0.72 & 46.9 \(\pm\) 29.9 & 0.38 & 0.77 & 0.91 \\ \hline \hline \end{tabular}
\end{table}
Table 12: Results from 60 samples for Fudge with different \(\lambda\) on topic control for a validation fantasy-topic bag of words. Note that during validation only, success directly measures use rate of words in the given bag \(\mathcal{W}\), not a heldout bag \(\mathcal{W^{\prime}}\) as in the main paper.

\begin{table}
\begin{tabular}{l c c c c c c} \hline \hline  & _On-Topic_ & \multicolumn{3}{c}{_Text Quality_} & \multicolumn{3}{c}{_Diversity_} \\ \cline{2-7} Method & **Success \(\uparrow\)** & Grammar \(\uparrow\) & Perplexity \(\downarrow\) & Dist-1 \(\uparrow\) & Dist-2 \(\uparrow\) & Dist-3 \(\uparrow\) \\ \cline{2-7} Fudge & 0.44 & 0.44 & 70.9 \(\pm\) 89.4 & 0.40 & 0.79 & 0.78 \\ FudgeMod & 0.39 & 0.43 & 72.1 \(\pm\) 66.3 & 0.41 & 0.79 & 0.77 \\ \hline \hline \end{tabular}
\end{table}
Table 14: Ablation of Fudge with a modified predictor architecture on couplet completion.

\begin{table}
\begin{tabular}{l c c c c c c} \hline \hline  & _On-Topic_ & \multicolumn{3}{c}{_Text Quality_} & \multicolumn{3}{c}{_Diversity_} \\ \cline{2-7} Method & **Success \(\uparrow\)** & Grammar \(\uparrow\) & Perplexity \(\downarrow\) & Dist-1 \(\uparrow\) & Dist-2 \(\uparrow\) & Dist-3 \(\uparrow\) \\ \hline Wdec, \(\lambda_{\text{WDEC}}=1\) & 0.02 & 0.83 & 34.5 \(\pm\) 23.5 & 0.36 & 0.78 & 0.91 \\ Wdec, \(\lambda_{\text{WDEC}}=2\) & 0.02 & 0.83 & 34.9 \(\pm\) 23.8 & 0.36 & 0.78 & 0.91 \\ Wdec, \(\lambda_{\text{WDEC}}=4\) & 0.57 & 0.79 & 34.7 \(\pm\) 23.6 & 0.33 & 0.74 & 0.86 \\ Wdec, \(\lambda_{\text{WDEC}}=8\) & 1.90 & 0.47 & 14.5 \(\pm\) 19.2 & 0.04 & 0.09 & 0.12 \\ Wdec, \(\lambda_{\text{WDEC}}=16\) & 2.32 & 0.40 & 8.4 \(\pm\) 9.6 & 0.01 & 0.04 & 0.06 \\ Wdec, \(\lambda_{\text{WDEC}}=32\) & 2.35 & 0.41 & 7.5 \(\pm\) 9.1 & 0.01 & 0.04 & 0.06 \\ \hline \hline \end{tabular}
\end{table}
Table 13: Results from 60 samples for WBC with different \(\lambda_{\text{WDEC}}\) on topic control for a validation fantasy-topic bag of words. Note that during validation only, success directly measures use rate of words in the given bag \(\mathcal{W}\), not a heldout bag \(\mathcal{W^{\prime}}\) as in the main paper.



measured by Transformer-XL. Full results in Tables 16 and 15.

## Appendix F Statistical Significance

In couplet completion, Fudge outperforms the strongest automated baseline (Finetune) on success rate with \(p<0.0001\) on a McNemar test, pairing the generations for each Shakespeare prefix.

In topic control, Fudge outperforms the strongest automated baseline Pplm with \(p=0.04\) using a Wilcoxon matched pairs test, pairing the generations for topic-prefix combinations.

In translation formality, Fudge's generations are more formal than those of the base \({\cal G}\) with \(p<0.0001\) according to a paired t-test.

```
Space: The issue focused on the new, higher level of control that NASA had in the space shuttle program.nUn"The question of how far the U.S. government can extend its jurisdiction in space was raised," Mr. Smith said.nUnNASA's role has become increasingly important in the 21st century in part because of the growth in space activities. The space shuttle program began in 1977 with
``` Politics: The issue focused on how much power each company was willing to use in response to the request.nunAccording to the complaint, Comcast has not been forthcoming with any data, such as how often it uses the technology, and what it has paid for it, in order to meet the FCC's mandate to make its own data more accessible.nUnAnd, according to the suit, the company also ```
Military: The issue focused on the use of force by the armed forces and police, as well as the use of lethal force by civilians.nUnThe bill would require that a shooting occur "with reasonable care," meaning a shot was "justified" under the circumstances of the case and not in rettaliation for an act of violence, and that a shooting was "necessary for the safety of the officer or the
```

**Algorithm 3**Fudge: A Survey of the Proposed Framework

## Appendix G Effect of Varying Topic Control Strength

Although we use \(\lambda=4\) for Fudge in our main paper experiments for topic control, we experiment here with varying the conditioning strength. Specifically, we experiment with \(\lambda=2\) and \(\lambda=8\). The conditioning is unsurprisingly stronger as \(\lambda\) increases, as shown quantitatively in Table 19, although the perplexity increases as well.

We also provide some example generations for \(\lambda=2\) and \(\lambda=8\) in Tables 18 and 21, for the same prompts and topics as in Table 6 for \(\lambda=4\) in the main text. The \(\lambda=8\) generations remain mostly fluent and interesting, despite their worse grammaticality and perplexity.

## Appendix H Effect of Varying Candidate Pruning

For computational efficiency, we only feed the top 200 candidates returned by \({\cal G}\) into Fudge's predictor when predicting each next token. Here, we ablate on this number in our topic control setting, testing 100 and 400 (Table 20).

## Appendix I Additional Couplet Completion Examples

We provide some additional examples of Fudge and baselines on our couplet completion task in Table 22.

We also show some unsuccessful examples for Fudge in 23. Overall, we find that most errors are due to the rhyme and ten-syllable end of sentence constraints, or due to Shakespeare's prefix ending in a word not in the CMU Pronouncing Dictionary (e.g., "prognosticate" in the table). Fudge also sometimes overgenerates punctuation at the end of a sentence.

 



\begin{table}
\begin{tabular}{l c c c c c c c} \hline \hline  & \multicolumn{2}{c}{_On-Topic_} & \multicolumn{3}{c}{_Text Quality_} & \multicolumn{3}{c}{_Diversity_} \\ \cline{2-7} Method & **Success \(\uparrow\)** & Grammar \(\uparrow\) & Perplexity \(\downarrow\) & Dist-1 \(\uparrow\) & Dist-2 \(\uparrow\) & Dist-3 \(\uparrow\) \\ \cline{2-7} Fudge, \(\lambda=2\) & 0.49 & 0.79 & 38.6 \(\pm\) 24.1 & 0.36 & 0.76 & 0.91 \\ Fudge, \(\lambda=4\) & 0.59 & 0.79 & 40.7 \(\pm\) 26.3 & 0.34 & 0.75 & 0.91 \\ Fudge, \(\lambda=8\) & 0.76 & 0.74 & 56.5 \(\pm\) 39.0 & 0.35 & 0.75 & 0.90 \\ \hline \hline \end{tabular}
\end{table}
Table 19: Future results for different values of \(\lambda\) on the main 7 topics and 20 prefixes. Success and perplexity both increase as the conditioning strength \(\lambda\) increases. Our main paper experiments use \(\lambda=4\).

\begin{table}
\begin{tabular}{p{34.



hyperparameter setting as in the main paper, \(\lambda=4\). Specifically, we provide the first generation by Fudge for 3 separate prefixes for each of the 7 topics. Virtually all examples are clearly on topic, while avoiding repetitiveness.

Additionally, we provide example generations from \({\cal G}\), Finetune and Wdec in Tables 28, 29, and 29 respectively. For Pplm we refer the reader to the examples in the main paper and appendices of Dathathri et al. (2019)'s original work.

**Space:** More importantly, the E4E-R-E-S-T report finds, the greatest threat to Earth's existence comes from the human race's inability to adapt: "It is clear from E4E's analysis that a lack of knowledge about how to manage an expanding world and to adapt to changing climatic conditions poses a serious challenge to our ability to sustain life on planet Earth.

**Politics:** More importantly, in an effort to preserve the historical integrity of the state's judicial system, the state also needs to ensure its integrity within the larger American political system through fair, transparent, and competitive elections. In other words, a system based upon meritocracy and equality for all candidates, voters, candidates and parties.uuThe Amenican people have a right to know whether the current system for electing state

**Military:** More importantly, the military has a great deal of leverage with its own soldiers and their superiors, and its willingness to use that leverage to force an immediate end to this practice of indefinite detention and indefinite imprisonment was demonstrated by the recent court order issued by the US District Court for the District of Columbia, which requires the release of an Iraqi-American held in an indefinite military detentations facility and a detainee

**Legal:** More importantly, in an effort to make the case that the law was needed because of its effects on the state's economy, the law's supporters claimed that the "death penalty was necessary to protect public safety." (The argument that the punishment was needed because it was needed to prevent certain crimes was rejected by the Court.) The state's argument was that the death penalty violated constitutional guarantees of due process,

**Science:** More importantly, it is the role of the C.S.A. to develop the technology to use such signals for its national defense, which the agency is doing through the fusion centers. It has been a longstanding goal of the C.S.A. to develop a fusion center that would be capable of processing such signals as well as to develop technologies to use them in other contexts. In recent

**Religion:** More importantly, the nature of the act of creation is seen differently in different traditions. In Islam, a Muslim woman's choice to cover up her face in front of other Muslims is seen as idolatry. This is because Islam prohibits the practice of covering up the faces of other women. In Christianity, the practice of covering up a woman's face is seen as idolatry. This is because

**Computers:** More importantly, it shows the complete inhabitive of an entire system to provide a fair shot and fair share of the pie for a large and diverse pool of users who are not only using the platform in a diverse range of contexts: it is a system that refuses to consider the many different ways in which a user may use the platform, including the many ways a user might engage with the site.nu 



**Space:** It has been shown in a pilot study in the United States and in an earlier pilot study in Europe that a combination of an advanced technology, including a laser and high-frequency pulsed light, was able to induce spontaneous cell death, which could be detected using an electroencephalogram (EEG).unIn"Our findings indicate the potential use of a small-scale laser to generate a

**Politics:** It has been shown that the "no" movement in France is growing, as evidenced by the increase in the vote in the national assembly on May 7th, 2012. As of now, it is a minority, and its support is shrinking with each passing day. The "no" movement has the potential to take over the government of the French Republic.UnUnIn the past years, France's

**Military:** It has been shown in several other laboratories that, while anaerobic digester systems, such as those deployed in the United States by Cummins, use a different and potentially safer process to extract and recycle the waste, their operation is also far more dangerous.Unn"We had a blast at Cummins and they are a very good company. They were very, very quick to come up with

**Legal:** It has been shown to be the case that a person with a criminal record is more likely to be a victim of domestic abuse and to experience more violence than the general population.Unn"Domestic abuse, whether a family member, a current or former partner or a stranger, can have devastating effects, not only on the person, but on their partner and others in their home.Unn"

**Science:** It has been shown to increase the efficiency of the central nerve fibers by as much as 50% in a single operation[11]. The results of the present experiments show that it is possible to activate the central nervous system by using nanomaterials in a novel fashion and to produce a therapeutic effect on various neurological diseases by the action of a single compound.UnUn In this study, the novel chemical

**Religion:** It has been shown that, once you become a devout Muslim, there will be an increase in your own religiosity. It can be seen from the following quote: "Islam was the religion that brought the first Muslims to Europe, and it has been the religion that will bring the first Muslims to the Americas."UnIn have heard a number of people tell me that their religion is based on a

**Computers:** It has been shown using a simple and reliable approach that when the right and left sides of the network are connected by a simple method, the network will become stronger.UnIn the network, a network of nodes is connected with each of them receiving the information from a node that is a neighbor of the node.UnThe neighbor node of the node receiving the information from the neighbor node is an

**Space:** To review, the plot is that a new Earth was discovered, and a group of scientists, led by the late Dr. Robert Zubrin, begin work. Their plan involves the creation of a giant space station called Orion, to be built in orbit to study the new Earth. The plan, however, has the unexpected side-effect of creating an artificial gravity well, which is then used to create

**Politics:** To review, the central issue in the case of the "Babylonian" text is the legitimacy of the text's existence, since it is based on an earlier, more primitive, text that was already in existence at the time of the Babylonians. It would therefore be wrong to conclude that the "Babylonian" text is an "authentic" document, since it shares certain

**Military:** To review, an army officer is an officer who has a direct, practical and active role in the development, execution and execution of war plans, and, in particular, in carrying out operations of combat importance."Unn"The military has a right to the exercise of its authority to carry out a range of operations, including the use of lethal force, against a hostile civilian population. The right of

**Legal:** To review, no one in their right mind should have accused them of lying about this.Unn"No one has a legal right to lie, but it is possible for people to lie if the facts do not support the allegation."UnBut a spokesman for the Attorney General, Dominic Grieve, said the case was "extremely difficult" and that a judge must consider "the full range of

**Science:** To review, the following are relevant:UnAnA) It was reported in Science that the study "is the first to show that an early age at conception can alter the brain structure of the brain-damaged."UnnB) The study "found brain abnormalities in the hippocampus--which is a key part of memory and learning--when an individual was exposed to a high-risk pregnancy or

**Religo:** To review, "God is a God of peace" is a simple concept to understand without understanding the meaning of "God is love." The phrase was popularized by a popular television show called, "God is Love." However, "God is a God of Peace" is not a "God of Peace" phrase. "God is a God of Peace" refers to Jesus Christ as the "Son

**Computers:** To review, if you are an active user, you can now download and install the latest version without using Google Play Store, you can now install a custom app on your phone without needing to open the Play Store, you can now run any of these custom apps without being restricted by Android's app permissions.UnUnFor the most part, we believe that the new features are an awesome addition to Android

\begin{table}
\begin{tabular}{p{346.9pt}} \hline \hline
**Page:** To review, the plot is that a new Earth was discovered, and a group of scientists, led by the late Dr. Robert Zubrin, begin work. Their plan involves the creation of a giant space station called Orion, to be built in orbit to study the new Earth. The plan, however, has the unexpected side-effect of creating an artificial gravity well, which is then used to create \\ \hline
**Politics:** To review, the central issue in the case of the “Babylonian” text is the legitimacy of the text’s existence, since it is based on an earlier, more primitive, text that was already in existence at the time of the Babylonian. It would therefore be wrong to conclude that the “Babylonian” text is an “authentic” document, since it shares certain \\ \hline
**Military:** To review, an army officer is an officer who has a direct, practical and active role in the development, execution and execution of war plans, and, in particular, in carrying out operations of combat importance.“Unn”The military has a right to the exercise of its authority to carry out a range of operations, including the use of lethal force, against a hostile civilian population. The right of \\ \hline
**Legal:** To review, no one in their right mind should have accused them of lying about this.Unn"No one has a legal right to lie, but it is possible for people to lie if the facts do not support the allegation.”UnBuut a spokesman for the Attorney General, Dominic Grieve, said the case was ”extremely difficult” and that a judge must consider “the full range of \\ \hline
**Science:** To review, the following are relevant:UnAnA) It was reported in Science that the study “is the first to show that an early age at conception can alter the brain structure of the brain-damaged.”UnnB) The study “found brain abnormalities in the hippocampus—which is a key part of memory and learnings—when an individual was exposed to a high-risk pregnancy or \\ \hline
**Religion:** To review, “God is a God of peace” is a simple concept to understand without understanding the meaning of “God is love.” The phrase was popularized by a popular television show called, “God is Love.” However, “God is a God of Peace” is not a “God of Peace” phrase. “God is a God of Peace” refers to Jesus Christ as the “Son \\ \hline \hline \end{tabular}
\end{table}
Table 26: Generations starting with “To review,” by Fudge. The first generation is selected for each prefix. The politics example is somewhat tangential but the other six are on topic. Words in the given bag are highlighted in red, and other related words in cyan.





**Space:** In summary, the following are the major findings of the study: Women who use condoms at least one time per year are more likely to use contraception than those who do not. Women who use condoms at least one time per year are more likely to use contraception than those who do not. Condoms may decrease a woman's risk of getting sexually transmitted infection (STI). This is

**Politics:** In summary, I believe it's the same with the current state of the industry and it's not a question of whether there are enough people, but how much of what we are producing is actually worth our own time. We must not forget that the majority of our readership consists of people who are not interested in learning more about the world of the internet or in the internet in general. They want

**Military:** In summary, this study demonstrated that the use of marijuana was associated with significantly lower risk of depression among college students. In addition, we identified that the association was independent of the use of other drugs, and thus may be due to the absence of confounding by other drug use and its impact on depression. We also identified significant associations between marijuana use and depression that are independent of other drug use and its impact

**Legal:** In summary, the new data suggests that women are increasingly being judged by their appearance and that, overall, they are less attractive than men.<lendoftext>In order to keep our readers from feeling overwhelmed or discouraged by the latest news, the Daily Dot takes some time to explain the basics of what you can expect to see in the world of eSports. 1. The eSports scene is growing The

**Science:** In summary, the most significant change was in the way we think about what is "true." The word "truth" has lost all meaning. In the past, people were told they were "telling the truth." Today, the only thing we think "truth" means are lies, and we have no idea whether we are telling a truth or not. The term "truth" has lost its meaning

**Religion:** In summary, the authors concluded that the findings of the current study indicate that, "The effects of the dietary supplement have been underestimated because they do not include all dietary components, including dietary fiber." The authors conclude: "Based on these results, we propose that, in order to fully understand the impact of dietary fiber on the metabolic syndrome, it is necessary to examine all dietary components, including

**Computers:** In summary, there is a lot of information available about the relationship between brain function during sleep and cognition, but it is still unclear whether these results are due more to differences in the brain's structure versus the way it works under the influence of sleep, or whether there may be some other underlying factor that is involved. We hope this review will contribute to this debate and to future research to shed more light

**Space:** In summary, the two are similar and they are both capable of performing similar operations. This means that the main advantage of both of them is their speed: they both use the same power. In addition to their speed, the two are equipped with various special abilities, such as the Power of the Sun's Light. In addition, both of them use various different abilities to their advantage. In order to

**Politics:** In summary, the U.K.'s economic policy is largely about economic growth, rather than a political one. Indeed it is much more important for governments to have access to wealth that can be easily earned and managed. The British Empire and Britain and other countries have been able to do that by creating a free market economy for workers and businesses. The fact that the British Empire and Britain have been able

**Military:** In summary, the current trend for the United States is a clear example of an economic crisis that has created many major economic and social problems. This is particularly true in countries like China and South Korea that have experienced a period of extreme unemployment and low incomes and are facing an uncertain and volatile climate. We will also note that the recent slump of prices of natural gas has been accompanied by a sharp increase

**Legal:** In summary, the government has proposed to the courts that the government will not be able to make decisions on this matter until the Court decides to grant or reject it. This is what the government is going to do. It is going to take an approach that is very different from the government's and that is not the law. They will try to take a different approach from the government's. If

**Science:** In summary, the results suggest that a high prevalence of breast cancer was found in the general population. The results do not indicate the extent to which breast cancer prevalence can differ between individuals.The authors also note that breast cancer prevalence may be greater among women who have been diagnosed with breast cancer than among those who have never been diagnosed with breast cancer. However, the evidence on the effects of breast

**Religion:** In summary, if the first person you see is an older person, or is the youngest person who is, then you will see the first person you will hear from. If the second person you would like to see is someone who is about to enter into a marriage with someone, or is the youngest person you would like to see, then you will hear the second person you would like to hear from!

**Compurters:** In summary, you need to do some basic math before you even get a "good" answer.The first thing we have to consider is whether the "good" answer is really that simple. A good answer is the one you want to get right. The "bad" answer is the one you don't like. So for now the good answer is: If you have a question, you

\begin{table}
\begin{tabular}{p{340.0pt}} \hline \hline
**Space:** In summary, the two are similar and they are both capable of performing similar operations. This means that the main advantage of both of them is their speed: they both use the same power. In addition to their speed, the two are equipped with various special abilities, such as the Power of the Sun’s Light. In addition, both of them use various different abilities to their advantage. In order to

**Politics:** In summary, the U.K.'s economic policy is largely about economic growth, rather than a political one. Indeed it is much more important for governments to have access to wealth that can be easily earned and managed. The British Empire and Britain and other countries have been able to do that by creating a free market economy for workers and businesses. The fact that the British Empire and Britain have been able

**Military:** In summary, the current trend for the United States is a clear example of an economic crisis that has created many major economic and social problems. This is particularly true in countries like China and South Korea that have experienced a period of extreme unemployment and low incomes and are facing an uncertain and volatile climate. We will also note that the recent slump of prices of natural gas has been accompanied by a sharp increase

**Legal:** In summary, the government has proposed to the courts that the government will not be able to make decisions on this matter until the Court decides to grant or reject it. This is what the government is going to do. It is going to take an approach that is very different from the government’s and that is not the law. They will try to take a different approach from the government’s. If

**Science:** In summary, the results suggest that a high prevalence of breast cancer was found in the general population. The results do not indicate the extent to which breast cancer prevalence can differ between individuals.The authors also note that breast cancer prevalence may be greater among women who have been diagnosed with breast cancer than among those who have never been diagnosed with breast cancer. However, the evidence on the effects of breast

**Religion:** In summary, if the first person you see is an older person, or is the youngest person who is, then you will see the first person you will hear from. If the second person you would like to see is someone who is about to enter into a marriage with someone, or is the youngest person you would like to see, then you will hear the second person you would like to hear from!

**Compurters:** In summary, you need to do some basic math before you even get a “good” answer.The first thing we have to consider is whether the ”good” answer is really that simple. A good answer is the one you want to get right. The ”bad” answer is the one you don’t like. So for now the good answer is: If you have a question, you



**Space:** In summary, the study found that women who were more likely to be obese and/or obese-ish in childhood were also more likely to have been overweight in adulthood. That's because they were more likely to experience negative childhood experiences that could cause them to gain body fat, which would later lead to later obesity. It's important to note that these researchers didn't actually examine the effects of

**Politics:** In summary, the government must state clearly that the tax authority has authority to tax imports of imports from imports of imports of imports of imports of imports of imports of imports of imports of imports of imports of imports of imports of imports of imports of imports of

tal, infantry, injury, intelligence, invade, invasion, jet, kill, leave, lieutenant, major, maneuver, marines, MIA, mid, military, mine, missile, mortar, navy, neutral, offense, officer, ordinance, parachute, peace, plane, platoon, private, radar, rank, recruit, regiment, rescue, reserves, retreat, ribbon, sabotage, sailor, salute, section, sergeant, service, shell, shoot, shot, sieee, sniper, soldier, spear, specialist, squad, squadron, staff, submarine, surrender, tactical, tactics, tank, torpedo, troops, bruce, uniform, unit, veteran, volley, war, warfare, warrior, weapon, win, wound
4. **Legal:** affidavit, allegation, appeal, appearance, argument, arrest, assault, attorney, bail, bankrupt, bankruptcy, bar, bench, warrant, bond, booking, capital, crime, case, chambers, claim, complainant, complaint, confess, confession, constitution, constitutional, contract, counsel, court, custody, damages, decree, defendant, defense, deposition, discovery, equity, estate, ethics, evidence, examination, family, law, felony, file, fraud, grievance, guardian, guilty, hearing, immunity, incarceration, incompetent, indicment, injunction, innocent, instructions, jail, judge, judiciary, jurisdiction, jury, justice, law, lawsuit, lawyer, legal, legislation, liable, litigation, manslaughter, mediation, minor, misdemeanor, moot, murder, negligence, oath, objection, opinion, order, ordinance, pardon, parole, party, perjury, petition, plaintiff, plea, precedent, prison, probation, proseccute, prosecutor, proxy, record, redress, resolution, reverse, revoke, robbery, rules, sentence, settlement, sheriff, sidebar, standing, state, stature, stay, subpoena, suit, suppress, sustain, testimony, theft, title, tort, transcript, trial, trust, trustee, venue, verdict, waiver, warrant, will, witness, writ, zoning
5. **Science:** astronomy, atom, biology, cell, chemical, chemistry, climate, control, data, electricity, element, energy, evolution, experiment, fact, flask, fossil, funnel, genetics, gravity, hypothesis, lab, laboratory, laws, mass, matter, measure, microscope, mineral, molecule, motion, observe, organism, particle, phase, physics, research, scale, science, scientist, telescope, temperature, theory, tissue, variable, volume, weather, weigh
6. **Religion:** absolute, affect, aid, angel, anthem, apostle, archangel, Archbishop, balance, ban, belief, benefit, Bible, bishop, bless, bliss, bond, bow, Buddhism, canon, Cantor, cathedral, celestial, chapel, charity, choice, Christianity, church, comfort, community, conflict, connection, conquest, conservative, control, conversion, convert, core, counsel, courage, Covenant, creative, Creator, cross, Crusade, Darkness, decision, de- city, destiny, Devil, disciple, discipline, discussion, divine, divinity, doctrine, duty, effect, elder, energy, essence, eternal, ethics, event, evidence, exile, Exodus, faith, family, fate, Father, favor, fundamental, gift, glory, God, gospel, grace, growth, guru, habit, hallow, halo, happiness, harmony, healing, Heaven, Hebrew, holy, honor, hope, host, humane, immortal, influence, insight, instruction, issue, Jesuit, Jesus, joy, Judaism, judgment, justice, karma, keen, Keystone, Kingdom, Latin, life, light, love, loving, marriage, meaning, mercy, Messiah, minister, miracle, mission, mortal, mosque, movement, music, mystery, nature, run, official, oracle, order, organ, Orthodox, outlook, pacific, pagan, parish, participation, pastor, patriarch, Peace, perception, personal, perspective, petition, pilgrim, politics, power, practice, prayer, prelude, presence, priest, principle, privacy, prophet, protection, purpose, query, quest, question, quiet, radiant, radical, rally, rebirth, redemption, refuge, relationship, relative, religion, religious, Revelation, ritual, role, Sacrament, sacred, sacrifice, sage, saint, salivation, sanctuary, sovictrup, scriptures, sect, security, sense, serious, serve, service, Sharia, shepherd, shrine, silence, sin, society, soul, source, spirit, spiritual, split, statue, Sunday, support, Supreme, teaching, temple, tests, text, Torah, tradition, traditional, trust, unique, unity, unknown, value, vanity, virtue, vision, voice, voices, watch, weight, whole, wisdom, wonder, yang, yin, zeal
7. **Computers:** algorithm, analog, app, application, array, backup, bandwidth, binary, bit, bite, blog, blogger, bookmark, boot, broadband, browser, buffer, bug, bus, byte, cache, caps, captcha, CD, client, command, compile, compress, computer, configure, cookie, copy, CPU, dashboard, data, database, debug, 

delete, desktop, development, digital, disk, document, domain, dot, download, drag, dynamic, email, encrypt, encryption, enter, FAQ, file, firewall, firmware, flaming, flash, folder, font, format, frame, graphics, hack, hacker, hardware, home, host, html, icon, inbox, integer, interface, Internet, IP, iteration, Java, joystick, kernel, key, keyboard, laptop, link, Linux, logic, login, lurking, Macintosh, macro, malware, media, memory, mirror, modem, monitor, motherboard, mouse, multimedia, net, network, node, offline, online, OS, option, output, page, password, paste, path, piracy, pirate, platform, podcast, portal, print, printer, privacy, process, program, programmer, protocol, RAM, reboot, resolution, restore, ROM, root, router, runtime, save, scan, scanner, screen, screenshot, script, scroll, security, server, shell, shift, snapshot, software, spam, spreadsheet, storage, surf, syntax, table, tag, template, thread, toolbar, trash, undo, Unix, upload, URL, user, UI, username, utility, version, virtual, virus, web, website, widget, wiki, window, Windows, wireless, worm, XML, Zip

### Prefixes

"An illustration of", "Emphasised are", "Foundational to this is", "Furthermore.", "In brief,", "In summary", "In this essay", "It has been shown", "More importantly,", "Prior to this", "The central theme", "The connection", "The issue focused on", "The key aspect", "The relationship", "This essay discusses", "To conclude,", "To review,", "To summarise", "Views on"

### Heldout Bags of Words

Note that our heldout bag construction process yielded two stopwords, which we removed; they are omitted below.

1. **Space:** actress, aeronautics, broadband, cosmonaut, cosmos, fireball, flyby, galaxies, heavens, interstellar, lander, lunar, mothership, Romulan, room, worlds
2. **Politics:** appropriated, aristocrats, authorisation, autocratic, capitalist, communist, credibility, cultural, democratic, diplomatic, efforts, energy, excise, exporting, fascist, federal, federated, freedom, gender, ideologies, immediate, imported, income, judge, jurisdiction, legislative, lengthy, minority, Nazism, progressivism, properties, purchase, ratify, referenda, remember, secondary, shortfall, socialist, subsidies, uphold
3. **Military:** aboard, academies, adjutant, advancing, airmen, allies, argue, armies, armsite, armour, amroury, assets, ATL, aviation, barrage, batteries, bleeding, bottom, bricks, cadre, camera, capturing, cargo, casting, casualties, citadel, civilian, civilians, clandestine, committee, companies, concern, outquered, cursor, customer, dead, decoding, defensive, deputy, detonated, dormitories, encoding, enemies, engaging, escorting, evacuating, execute, expert, explosion, fatigues, flames, flying, forcing, forming, fought, freedom, frigate, gatling, glider, groan, guerilla, hand-to-hand, highest, hires, honour, howitzer, ICBM, injuries, inundate, invading, Iraq, khaki, knowledge, lace, late, launchers, leaving, lob, longtime, Maj., manoeuvre, medical, militia, naval, offensively, offices, operation, paragraph, personnel, persuade, pirate, pistol, policeman, propel, proposal, public, pump, rear, relinquish, rescuing, rifle, rifleman, rifles, rocket, sabotaging, samurai, scouts, secluded, seige, Sgt., ship, shoulders, significant, skipper, skirmish, sl loop, sonar, stationed, strategic, strategy, subsidiary, sunk, sword, taken, team, tensions, terms, threat, tribute, victory, visor, wear, won, zone, zoning
4. **Legal:** accusation, acquittal, admit, aggrieved, agreement, alleging, amendment, appearing, appellant, asserted, assertion, assalt, authority, burglary, championship, convicted, conviction, criminal, custodial, debatable, decision, defensive, democratic, deposited, deputies, disagree, discoveries, dispute, disputes, edict, embezzlement, enforcement, ethical, event, exams, families, federal, felonies, findings, folder, forgive, heard, homicide, immune, incarcerated, inept, injunctive, innaces, insolvency, insolvent, investment, judgment, judicial, jurors, knowing, land-use, leave, legislative, liability, litern, maintain, major, malpractice, mandamus, mediator, mutual, negligent, objecting, offender, pants, parties, passageways, pixels, police, property, prosecuting, prosecution, proxies, 

purchase, quash, regulations, repress, requesting, rescind, reservation, respondent, restaurant, revelation, reversing, rulings, second-degree, sentencing, sitting, solicitor, statutory, step-by-step, sued, sworn, testify, track, transcribed, treasurer, waived, whether, widget, wrongful, wrongs
5. **Science:** action, astronomical, bacterium, bone, clinical, component, compounds, electron, electrons, evolved, flow, fuels, genomics, gravitational, humidity, hypotheses, idea, increasing, jug, ligand, magnesium, mathematics, measuring, microscopy, molecular, nothing, observatory, observing, parameter, phone, physicist, physiology, pounds, rain, reason, renewable, scaling, scientific, siphon, statutes, stored, studies, system, tests, theories, transition, warming
6. **Religion:** Adventure, Almighty, Always, Answer, Appeals, Aramaic, Assistance, Association, Atlantic, Attorney, Balancing, Baptist, Basilica, Baskets, Best, Buddhist, Bunyan, Calculator, Calvary, Catholic, Catholicism, Charitable, Charities, Chen, Cognition, Communities, Compassion, Connery, Constantinople, Contemporary, Cosmic, Cost, Court, Creativity, Criminal, Crisis, Cure, Curriculum, Dangerous, Database, Date, Death, Deities, Demon, Determining, Dharma, Diocese, Double, Dreams, Echoes, Economic, Elegant, Emanuel, Empires, EOS, Episcopal, Epistle, Ethical, Sucharist, Everlasting, Excel, Existence, Factors, Fallen, Families, Fervor, Focus, Foods, Forums, Freedom, Glad, Glorious, Heart, Heavy, Hell, Help, Him, Honour, Hospital, Hypothesis, Impact, Implications, Influencing, Injunction, Intel, Invitations, Involvement, Jewish, Judas, judgement, Kenichi, Kiss, Kombat, Lamp, Laughter, Learning, Levitticus, Liberal, Liberation, Lisa, Lives, Lord, Loss, Lust, Maker, Mandir, Marital, Married, Mary, Masjid, Meditation, Melody, Merrell, Metatron, Methodist, Militant, Mind, Mirror, Modernity, Morality, Mother, Motivation, Muhammad, Mutual, Mysteries, Mstical, Nanak, Natural, Network, ODST, Oneness, Outreach, PDF, Piano, Policy, Political, Pope, Practicing, Praise, Preview, Prime, Prostitute, Provider, Punishment, Purchase, Pure, Qi, Queries, Radiance, Rallis, Reixianration, Remote, Renewable, Resurrection, Rev., Rites, Safety, sanctuaries, Saturday, Savoiur, Scrolls, Sculpture, Secular, Secure, Self, Sermon, Serving, Shadows, Shari'a, Shinto, Significance, Silent, Sonata, Songs, Spangled, Spanish, SPCA, SQL, St., Stevie, Suites, Supply, Sweet, SWF, Talmud, Templar, Terrier, Testament, Testing, Thank, Theology, Thyme, Tie, TransCanada, Truth, Uncharted, Understanding, United, Venue, Videos, VoIP, Volume, Vote, Wetlands, Wircan, worship
7. **Computers:** 512MB, allows, Android, article, attribute, autocomplete, automatically, back-up, barcode, beach, binaries, button, C++, caching, cake, camera, capabilities, casing, chairs, change, cheat, chew, choice, click, coder, compiling, components, computation, contributing, confidentiality, configuring, connections, console, copies, counterfeiting, creating, crucial, customer, CyanogemMod, cyber, debian, decimal, decrypt, decryption, deflate, deleting, demo, detect, developing, dialog, dialup, direction, disc, display, DNS, DSL, DVD, e-mail, edit, educational, elements, encyclopedia, Excel, execute, extract, Firefox, fixes, flames, Frequently, functionality, gamepad, garbage, glass, gmail, GPU, guest, hats, house, identifier, infected, initialize, inkjet, input, interactive, interview, ISP, iterative, Jacket, journalists, jQuery, latency, layout, little, logon, lurk s, Macs, mails, mainboard, memories, mice, must, notebook, off-line, on-line, operand, original, overflow, packet, pane, paper, parasite, parsing, pasting, PDF, phishing, phb, pixels, point-in-time, popup, prev, profit, pull, query, reasoning, rectangular, redirect, rename, restart, restoring, run-time, sailor, saving, search, secure, shoe, sidebar, signal, sites, Solaris, spyware, step, stored, storing, subdirectory, taxi, telephone, text, tools, topic, torrent, touchpad, typeface, Ubuntu, update, usb, utilities, visuals, VPN, wifi, workstation, writer, XP, XSLT 

Additional Machine Translation Formality Examples

We provide some additional examples of Fudge against baselines on our machine translation formality task in Table 30.

## Appendix M Software

All models are implemented in PyTorch Paszke et al. (2019), and pretrained models \(\mathcal{G}\) are obtained from HuggingFace Wolf et al. (2019). Specifically, the Marian translation model is [https://huggingface.co/Helsinki-NLP/opus-mt-es-en](https://huggingface.co/Helsinki-NLP/opus-mt-es-en).