We propose a novel conditioned text generation model. It draws inspiration from traditional template-based text generation techniques, where the source provides the content (i.e., what to say ), and the template influ-ences how to say it . Building on the successful encoder-decoder paradigm, it first encodes the content representation from the given input text; to produce the output, it retrieves exemplar text from the training data as soft templates, which are then used to construct an exemplar-specific decoder. We evaluate the proposed model on abstractive text summarization and data-to-text generation. Empirical results show that this model achieves strong performance and outperforms comparable baselines. Conditioned text generation is the essence of many natural language processing (NLP) tasks, e.g., text summarization (Mani, 1999), machine translation (Koehn, 2009), and data-to-text generation (Kukich, 1983; McKeown, 1992; Reiter and Dale, 1997). In its common neural sequence-to-sequence formulation (Sutskever et al., 2014; Cho et al., 2014), an encoder-decoder architecture is used. The decoder generates the text autoregres-sively, token-by-token, conditioning on the feature representations encoded from the source, typically with attention (Bahdanau et al., 2015) and copy mechanisms (Gu et al., 2016; See et al., 2017). This paradigm is capable of generating fluent abstractive text, but in an uncontrolled and sometimes unreliable way, often producing degenerate outputs and favoring generic utterances (Vinyals and Le, 2015; Li et al., 2016). ods (Becker, 2002; Foster and White, 2004; Reiter et al., 2005; Gatt and Reiter, 2009, inter alia ), where the source content is filled into the slots of a handcrafted template. These solutions offer higher generation precision compared to neural approaches (Wiseman et al., 2017), but tend to lack the naturalness of neural systems, and are less scalable to open domain settings, where the number of required templates can be prohibitively large. To sidestep the scalability problems with handcrafted templates, it has been proposed to use similar training samples as exemplars , to guide the decoding process (Gu et al., 2018; Guu et al., 2018; Weston et al., 2018; Pandey et al., 2018; Cao et al., 2018a, inter alia ). 1 In general, existing methods accomplish this by (a) using traditional information retrieval (IR) techniques for exemplar extraction (e.g., TF-IDF), and then (b) concatenating the exemplar to the source as additional inputs, allowing the decoder to attend over and copy from both. We propose a different strategy for using exemplars. For motivation, Figure 1 shows a source-target pair together with its exemplar from the Gigaword dataset (Graff et al., 2003). The target is a summary of the source sentence, and the exemplar is retrieved from the training set (  3.2). 2 There is word overlap between the exemplar and the desired output, which would be easily captured by an attention/copy mechanism (e.g. Norway and aid ). Despite this, ideally, the model should also exploit the structural and stylistic aspects to produce an output with a similar sentence structure, even if the words are different. The term exemplar indicates a training instance used to help generation. We aim to distinguish from templates, since here no explicit slot-filling procedure is involved. 2 We use the training target as the exemplar, whose source is most similar to the current input. 3.2 describes the details. Source : Norway said Friday it would give Zimbabwe 40 million kroner (7.02 million dollars, 4.86 million euros) in aid to help the country deal with a lack of food and clean drinking water and a cholera outbreak. Exemplar : Norway boosts earthquake aid to Pakistan. Target : Norway grants aid of 4.86 million euros to Zimbabwe. Figure 1: A source-target pair from Gigaword training set, along with its exemplar. is supposed to determine what to say, while the templates aim to address how to say it, reminiscent of the classical content selection and surface realization pipeline (Reiter and Dale, 1997). For instance, an ideal template for this example might look as follows: grants aid of to In the neural formulation, the how to say it aspect is primarily controlled by the decoder. Inspired by the above intuition, we propose exemplar-based adaptive decoding , where a customized decoder is constructed for each exemplar. This is achieved by letting the exemplars to directly influence decoder parameters through a reparameterization step (  3.1). The adaptive decoder can be used as a drop-in replacement in the encoder-decoder architecture. It offers the potential to better incorporate the exemplars' structural and stylistic aspects into decoding, without excessive increase in the amount of parameters or computational overhead. We empirically evaluate our approach on abstractive text summarization and data-to-text generation (  4), on which most of the recent efforts on exemplar-guided text generation have been studied. On three benchmark datasets, our approach outperforms comparable baselines, and achieves performance competitive with the state of the art. The proposed method can be applicable in many other conditioned text generation tasks. Our implementation is available at https://homes. cs.washington.edu/hapeng . This section lays out the necessary background and notations for further technical discussion. We begin with conditioned text generation and the encoder-decoder framework (Sutskever et al., 2014; Cho et al., 2014). In the interest of the notation clarity,  3 will use an Elman network (El-man, 1990) as a running example for the decoder, which is briefly reviewed in 3. The proposed technique generalizes to other neural network architectures (  3.3). Conditioned text generation and the encoder-decoder architecture. Our discussion centers around conditioned text generation, i.e., the model aims to output the target y = y 1 y 2 . . . y T given the source input x = x 1 x 2 . . . x S , both of which are sequences of tokens. Each token x i , y i takes one value from a vocabulary V . x and y could vary depending on the tasks, e.g., they will respectively be articles and summaries for text summarization; and for data-to-text generation, x would be structured data, which can sometimes be linearized (Lebret et al., 2016; Wiseman et al., 2018, inter alia ), and y is the output text. We aim to learn a (parameterized) conditional distribution of the target text y given the source x , p  y | x  = TY t =1 p  y t | y <t , x  , (1) where y <t = y 1 . . . y t  1 is the prefix of y up to the ( t  1) th token (inclusive). The probability of each target token is usually estimated with a softmax function: p ( y t | y <t , x ) = exp h > t  1 w y t P y exp h > t  1 w y . (2) w y denotes a learned vector for token y 2 V . h t  1 depends on y <t and x , and is computed by a function which we will describe soon. A typical implementation choice for computing h t is the encoder-decoder architecture (Sutskever et al., 2014). More specifically, an encoder g  first gathers the feature representations from the source x ; then a decoder f  is used to compute the h t feature vectors: h t = f   y t , h t  1 , g  ( x )  . (3)  and  are, respectively, the collections of parameters for the encoder and the decoder, both of which can be implemented as recurrent neural networks (RNNs) such as LSTMs (Hochre-iter and Schmidhuber, 1997) or GRUs (Cho et al., 2014), or the transformer (Vaswani et al., 2017). In Sutskever et al. (2014), the dependence of f  on g  is made by using the last hidden state of the encoder as the initial state of the decoder. Such dependence can be further supplemented with attention (Bahdanau et al., 2015) and copy mechanisms (Gu et al., 2016; See et al., 2017), as we will do in this work. 3 introduces how we use exemplars to inform decoding, by dynamically constructing the decoder's parameters  . For the notation clarity, we will use the Elman network as a running example, reviewed below. Elman networks. Given input sequence x , an Elman network (Elman, 1990) computes the hidden state at time step t from the previous one and the current input token by h t = tanh  Ph t  1 + Qv t  , (4) where P and Q are learned d  d parameter matrices (with d being the hidden dimension), and v t is the embedding vector for token x t . We omit the bias term for clarity. This section introduces the proposed method in detail. Our aim is to use exemplars to inform the decoding procedure (i.e., how to say it ). To accomplish this, we reparameterize the decoder's parameters with weighted linear sums, where the coefficients are determined by an exemplar. The decoder is adaptive , in the sense that its parameters vary according to the exemplars. The adaptive decoder can be used as a drop-in replacement in the encoder-decoder architecture. Before going into details, let us first overview the high-level generation procedure of our model. Given source text x , the model generates an output as follows: 1. Run a standard encoder to gather the content representations g  ( x ) from the source. 2. Retrieve its exemplar z x , and compute exemplar-specific coefficients (  3.2). 3. Construct the adaptive decoder parameters  (  3.1), using the coefficients computed at step 2. Then the output is generated by applying the adaptive decoder followed by a softmax , just as in any other encoder-decoder architecture. Aiming for a smoother transition, we will first describe step 3 in  3.1, and then go back to discuss step 2 in  3.2. For clarity, we shall assume that the decoder is implemented as an Elman network (El-man, 1990; Equation 4). The proposed technique generalizes to other neural network architectures, as we will discuss later in  3.3. At its core, the exemplar-specific adaptive decoder involves a reparameterization step, which we now describe. We focus on the parameters of the Elman network decoder, i.e., P and Q in Equation 4. We aim to reparameterize the pair of matrices ( P , Q ) , in a way that they are influenced by the exemplars. Let us first consider an extreme case, where one assigns a different pair of parameter matrices to each exemplar, without any sharing. This leads to an unreasonably large amount of parameters, which are difficult to estimate reliably. 3 We instead construct P and Q from a set of pre-defined parameters matrices. Take P for example, it is computed as the weighted sum of P i matrices: P = r X i =1  i P i , (5) where P i 2 R d  d , with d being the size of the hidden states. r is a hyperparameter, determining the number of P i matrices to use. 4 The summation is weighted by the coefficients  i , which are computed from the exemplar z x . For clarity, the dependence of both P and  i on z x is suppressed when the context is clear. Equation 5 constructs the decoder's parameter matrix P using a linear combination of { P i } ri =1 . The exemplar informs this procedure through the coefficients  i 's, the detailed computation of which is deferred to  3.2. The other matrix Q can be similarly constructed by Q = P i  i Q i . Rank-1 constraints. In the above formulation, the number of parameters is still r times more than a standard Elman network, which can lead to over-fitting with a limited amount of training data. Besides, it would be more interesting to compare the adaptive decoder to a standard RNN under a comparable parameter budget. Therefore we want to further limit the amount of parameters. This can be achieved by forcing the ranks of P i and Q i to be 1, since it then takes 2 d parameters to form each of them, instead of d 2 . More formally, we upper-3 The amount of parameters grows linearly with the number of possible exemplars, which, as we will soon discuss in  3.2, can be as large as the training set. 4 Instead of choosing r empirically, we set it equal to d in the experiments. Please see the end of  3.1 for a related discussion. P i = u ( p ) i  v ( p ) i . (6) a  b = ab > denotes the outer product of two vectors; u ( p ) i and v ( p ) i are learned d -dimensional vectors. Each Q i can be similarly constructed by a separate set of vectors Q i = u ( q ) i  v ( q ) i . Let U p , V p 2 R d  r denote the stack of u ( p ) i , v ( p ) i vectors, i.e., U p = h u ( p ) 1 , . . . , u ( p ) r i , (7a) V p = h v ( p ) 1 , . . . , v ( p ) r i . (7b) Equations 5 and 6 can be compactly written as P = U p  V > p . (8) where  is the diagonal matrix built from the r dimensional coefficient vector  = [  1 , . . . ,  r ] > :  = diag(  ) = 2 64  1 ...  r 3 75 . (9) The construction of Q is similar, but with a different set of parameters matrices U q and V q : 5 Q = U q  V > q . (10) Note that, despite their similarities to SVD at a first glance, Equations 8 and 10 are not performing matrix factorization. Rather, we are learning { U p , V p , U q , V q } directly; P , Q , { P i } , and { Q i } are never explicitly instantiated (Peng et al., 2017, 2018c). To summarize, we reparameterize P and Q as interpolations of rank-1 matrices. By the fact that rank( A + B )  rank( A ) + rank( B ) , the ranks of P and Q are upper-bounded by r . As pointed out by Krueger and Memisevic (2017), the parameter matrices of a trained RNN tend to have full rank. Therefore, in the experiments, we set r equal to the hidden size d , aiming to allow the adaptive decoder to use full-rank matrices in the recurrent computation. Yet, if one holds a priori beliefs that the matrices should have lower ranks, using r < d could be desirable. When r = d , an adaptive RNN constructed by the above approach has 4 d 2 parameters, which is comparable to the 2 d 2 parameters in a standard Elman network. 6 5 The bias term in the Elman network b can be constructed as b = B  , with B being a learned d  r matrix. We now discuss the computation of coefficients  , through which the exemplars inform the decoder construction (Equations 8 and 10). Before detailing the neural network architecture, we begin by describing the exemplar retrieval procedure. Retrieving exemplars z x . Intuitively, similar source texts should hold similar targets. Therefore, given source input x , we use the training target as its exemplar z x , whose source is most similar to x . 7 To compute the similarities between source texts, we use bag-of-words (BOW) features and cosine similarity. We extract the top-1 exemplar for each instance. This step is part of the preprocessing, and we do not change the exemplars as the training proceeds. There are, of course, many other strategies to get the exemplars, e.g., using handcrafted or heuristically created hard templates (Reiter et al., 2005; Becker, 2002; Foster and White, 2004, inter alia ), randomly sampling multiple training instances (Guu et al., 2018), or learning a neural reranker (Cao et al., 2018a). Using more sophistically extracted exemplars is definitelly interesting to explore, which we defer to future work. Computing coefficients. Next we describe the computation of  , the r -dimensional coefficient vector, which is used to construct the adaptive decoder (Equations 8 and 10). Intuitively, the rank-1 matrices ( P i 's and Q i 's in Equation 6 and thereafter) can be seen as capturing different aspects of the generated text. And  determines how much each of them contributes to the adaptive decoder construction. A natural choice to calculate  is to use the similarities between the exemplar and each of the aspects. To accomplish this, we run a RNN encoder over z x , and use the last hidden state as its vector representation a . 8 We further associate each ( P i , Q i ) pair with a learned vector c i ; and then  i is computed as the similarity between a and c i , using an inner product  i = a > c i . More compactly,  = Ca , (11) with C = [ c 1 , . . . , c r ] > . 7 The source of an exemplar is only used in the retrieval and never fed into the encoder-decoder model. For a training instance, we additionally disallow using its own target as the exemplar. 8 For clarity, the dependence of a on the exemplar z x is suppressed, just as  . Closing this section, Algorithm 1 summarizes the procedure to construct an adaptive decoder. Although we've based our discussion on Elman networks so far, it is straightforward to apply this method to its gated variants (Hochreiter and Schmidhuber, 1997; Cho et al., 2014, inter alia ), and other quasi-/non-recurrent neural architectures (Bradbury et al., 2017; Vaswani et al., 2017; Peng et al., 2018a, inter alia ). Throughout the experiments, we will be using an adaptive LSTM decoder (  4). As a drop-in replacement in the encoder-decoder architecture, it introduces a reasonable amount of additional parameters and computational overhead, especially when one uses a small encoder for the exemplar (i.e., the sizes of the c i vectors in Equation 11 are small). It can benefit from the highly-optimized GPU implementations, e.g., CuDNN, since it uses the same recurrent computation as a standard nonadaptive RNN. In addition to the neural networks, the adaptive decoder requires access to the full training set due to the retrieval step. In this sense it is semi-parametric . 9 The idea to dynamically construct the parameters is inspired by Hypernet-works (Ha et al., 2017) and earlier works therein. It proves successful in tasks such as classifica-tion (Jia et al., 2016; Liu et al., 2017) and machine translation (Platanios et al., 2018). Many recent template-based generation models include the exemplars as content in addition to the source, and allow the decoder to attend over and copy from both (Gu et al., 2018; Guu et al., 2018; Weston et al., 2018; Pandey et al., 2018; Cao et al., 2018a, inter alia ). We compare to this approach in the experiments, and show that our model offers fa-9 Nothing prohibits adaptively constructing other components of the model, e.g., the encoder g  . Yet, our motivation is to use exemplars to inform how to say it , which is primarily determined by the decoder (in contrast, the encoder relates more to selecting the content). vorable performance, and that they can potentially be combined to achieve further improvements. This section empirically evaluates the proposed model on two sets of text generation tasks: abstractive summarization (  4.2) and data-to-text generation (  4.3). Before heading into the experimental details, we first describe the architectures of the compared models in  4.1. In addition to previous works, we compare to the following baselines, aiming to control for confounding factors due to detailed implementation choices. SEQ 2 SEQ . The encoder-decoder architecture enhanced with attention and copy mechanisms. The encoder is implemented with a bi-directional LSTM (BiLSTM; Hochreiter and Schmidhuber, 1997; Schuster and Pali-wal, 1997; Graves, 2012), and the decoder a uni-directional one. We tie the input embeddings of both the encoder and the decoder, as well as the softmax weights (Press and Wolf, 2017). We use beam search during evaluation, with length penalty (Wu et al., 2016). ATTEXP . It is based on SEQ 2 SEQ . It encodes, attends over, and copies from the exemplars, in addition to the source inputs. Our model using the adaptive decoder (ADADEC ) closely builds upon SEQ 2 SEQ . It uses a dynamically constructed LSTM decoder, and does not use attention or copy mechanisms over the encoded exemplars. The extracted exemplars are the same as those used by ATTEXP . To ensure fair comparisons, we use comparable training procedures and regularization techniques for the above models. The readers are referred to the appendix for further details such as hyperparameters. Datasets. We empirically evaluate our model on two benchmark text summarization datasets:  Annotated Gigaword corpus (Gigaword; Graff et al., 2003; Napoles et al., 2012). Gigaword contains news articles sourced from various news services over the last two decades. To produce the dataset, we follow the split and preprocessing by Rush et al. (2015), and pair the first sentences and the headlines in the news articles. It results in a 3.8M/190K/1,951 train/dev./test split. The average lengths of the source and target texts are 31.4 and 8.2, respectively. New York Times Annotated Corpus (NYT; Sandaus, 2008). It contains news articles published between 1996 and 2007 by New York Times. We use the split and preprocessing by Durrett et al. (2016). 10 Following their effort, we evaluate on a smaller portion of the test set, where the gold summaries are longer than 50 tokens. We further randomly sample 9,000 instances from the training data for validation, resulting in a 91,834/9,000/3,452 train/dev./test split. Compared to Gigaword, the inputs and targets in NYT are much longer (averaging 939.0 and 48.6, respectively). Table 1 summarizes some statistics of the datasets. We note that some recent works use a different split of the NYT corpus (Paulus et al., 2018; Gehrmann et al., 2018), and thus are not comparable to the models in Table 3. We decide to use the one by Durrett et al. (2016) because their preprocessing script is publicly available. For both datasets, we apply byte-paired encoding (BPE; Sennrich et al., 2016), which proves to improve the generation of proper nouns (Fan et al., 2018). on Gigaword test set in ROUGEF 1 (Lin, 2004). 11 By using adaptive decoders, our model (ADADEC ) improves over SEQ 2 SEQ by more than 1.1 ROUGE scores. Cao et al. (2018b) and the FULL model by Cao et al. (2018a) hold the best published results. The former uses extensive handcrafted features and relies on external information extraction and syntactic parsing systems; 10 https://github.com/gregdurrett/ berkeley-doc-summarizer . while the latter uses additional encoding, attention and copy mechanisms over the exemplars extracted using a novel neural reranker. ADADEC achieves better or comparable performance to the state-of-the-art models, without using any handcrafted features or reranking techniques. The BASIC model by Cao et al. (2018a) ablates the reranking component from their FULL model, and uses the top exemplar retrieved by the IR system. Therefore it is a more comparable baseline to ours. ADADEC outperforms it by more than 1.3 ROUGE scores. Surprisingly, we do not observe interesting improvements by ATTEXP over the sequence-to-sequence baseline. We believe that our model can benefit from better extracted exemplars by, e.g., applying a reranking system. Such exploration is deferred to future work. The NYT experimental results are summarized in Table 3. We follow previous works and report limited-length ROUGE recall values. 12 Durrett et al. (2016) is an extractive model, and Paulus et al. (2018) an abstractive approach based on reinforcement learning. Our ADADEC model outperforms both. We observe similar trends when comparing ADADEC to the SEQ 2 SEQ and ATTEXP baselines, with the exception that ATTEXP does improve over SEQ 2 SEQ . Data-to-text generation aims to generate textual descriptions of structured data, which can be 12 Following Durrett et al. (2016) and Paulus et al. (2018), we truncate the predictions to the lengths of the gold summaries, and evaluate ROUGE recall, instead of F 1 on full-length predictions. seen as a table consisting of a collection of records (Liang et al., 2009). For a given entity, each record is an (attribute, value) tuple. Figure 2 shows an example for entity Jacques-Louis David . The table specifies the entity's properties with tuples (born, 30 August 1748) , (nationality, French) , and so forth. The table is paired with a description, which the model is supposed to generate using the table as input. We refer the readers to Lebret et al. (2016) for more details about the task. Dataset and implementation details. We use the Wikibio dataset (Lebret et al., 2016). It is automatically constructed by pairing the tables and the opening sentences of biography articles from English Wikipedia. We follow the split and preprocessing provided along with the dataset, with around 583K/73K/73K train/dev./test instances. Following Lebret et al. (2016), we linearize the tables, such that we can conveniently train the sequence-to-sequence style models described in  4.1. Table 1 summarizes some statistics of the dataset. In contrast to the text summarization experiment (  4.2), we do not apply BPE here. Further, the word embeddings are initialized with GloVe (Pennington et al., 2014; fixed during training), and not tied with the softmax weights. In addition to the models introduced in  4.1, we additionally compare to ADADEC +A TTEXP , aiming to study whether the adaptive decoder can further benefit from attention and copy mechanisms over the exemplars. the Neoclassical style. et al., 2002). 13 Table 4 summarizes the data-to-text generation results on the Wikibio test set. Overall, we observe similar trends to those in the summarization experiment (  4.2): by attending over and copying from the exemplars, ATTEXP improves upon the SEQ 2 SEQ baseline by around 0.6 absolute scores. Also utilizing exemplar information, our ADADEC model outperforms SEQ 2 SEQ by a larger margin: 1.3 for ROUGE -4 and 1.1 for BLEU . We further study whether we can get further improvements by combining both. ADADEC +A TTEXP achieves around 0.5 absolute improvements over ADADEC , less than those by ATTEXP over SEQ 2 SEQ . This provides evidence that, to some extend, the ways ATTEXP and ADADEC incorporate exemplar information might be complementary. Wiseman et al. (2018) is a template-motivated model based on a semi-Markov model. Liu et al. (2018) hold the current state-of-the-art results. They encode the table structures by using (a) position and filed embeddings, and (b) structure-aware attention and gating techniques. These techniques are beyond the scope of this work, which focuses mainly on the decoding end. 13 We use the script by Lin (2004) to calculate the ROUGE score, and the mteval script for BLEU : https:// github.com/moses-smt/mosesdecoder/blob/master/scripts/generic/mteval-v13a.pl . We now qualitatively evaluate our model, by studying how its outputs are affected by using different exemplars. Figure 3 shows two randomly sampled Gigaword development instances. It compares the outputs by ADADEC (i.e., without attention/copy over exemplars;  4.1) when receiving different exemplars, controlling for the same source inputs. In each example, Exemplar 1 is retrieved by the system (i.e., a training target;  3.2); while the remaining ones are produced by the authors, by modifying the first one in styles and sometimes introducing distractions in the content. In the top example, the model includes people into the subject ( Three vs. Three people ) under the influence by Exemplar 2 ; Exemplar 3 changes the tense and adds some distraction by changing the place from Britain to Canada . The model follows the tense switch, but gets confused by the distraction, and decides to let a train in southern Europe collide into North America, which it should not. Looking at the bottom example, the model in general follows the exemplar in using noun adjuncts or prepositional phrases (e.g., new home sales vs. sales of new homes ), except the first one. Perhaps confused by the distraction in Exemplar 3 , the model makes a judgment on the specific amount of growth, but gets it wrong. Exemplar-based generation. Partly inspired by traditional template-based generation (Kukich, 1983; Reiter and Dale, 1997, inter alia ), many recent efforts have been devoted to augmenting text generation models with retrieved exemplars (Ho-dosh et al., 2013; Mason and Charniak, 2014; Song et al., 2016; Lin et al., 2017, inter alia ). Without committing to an explicit slot-filling process, a typical method is to include exemplars as additional inputs to the sequence-to-sequence models (Gu et al., 2018; Pandey et al., 2018; Guu et al., 2018, inter alia ). Wiseman et al. (2018) took a different approach and used a semi-Markov model to learn templates. Dynamic parameter construction. The idea of using a smaller network to generate weights for a larger one dues back to Stanley et al. (2009) and Koutnik et al. (2010), mainly under the evolution computing context. It is later revisited with representation learning (Moczulski et al., 2015; Fernando et al., 2016; Al-Shedivat et al., 2017, inter alia ), and successfully applied to classifica-tion (Jia et al., 2016; Liu et al., 2017) and machine translation (Platanios et al., 2018). We presented a text generation model using exemplar-informed adaptive decoding. It repa-rameterizes the decoder using the information gathered from retrieved exemplars. We experimented with text summarization and data-to-text generation, and showed that the proposed model achieves strong performance and outperforms comparable baselines on both. The proposed model can be applicable in other conditioned text generation tasks. We release our implementation at https://homes.cs.washington. edu/hapeng . We thank Antonios Anastasopoulos, Ming-Wei Chang, Michael Collins, Jacob Devlin, Yichen Gong, Luheng He, Kenton Lee, Dianqi Li, Zhouhan Lin, Slav Petrov, Oscar Tackstrom, Kristina Toutanova, and other members of the Google AI language team for the helpful discussion, and the anonymous reviewers for their valuable feedback.
objective abstain abstain objective abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain objective abstain abstain abstain abstain abstain objective method abstain abstain abstain abstain abstain abstain abstain objective abstain abstain abstain method result abstain other abstain other abstain other other other objective other other objective other other method other other other other abstain method method other other method abstain method method abstain abstain method abstain abstain abstain abstain abstain method method method method method objective objective abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain method abstain objective objective objective objective objective objective objective objective objective abstain abstain objective abstain abstain objective abstain abstain abstain abstain abstain abstain abstain method method method abstain abstain abstain abstain method abstain abstain abstain method method abstain abstain method abstain abstain method method abstain abstain abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain method abstain abstain method abstain abstain method abstain abstain abstain abstain abstain abstain abstain method method abstain abstain abstain abstain method method abstain abstain abstain abstain other abstain abstain abstain abstain abstain abstain method abstain abstain method abstain abstain abstain abstain method abstain abstain abstain abstain abstain abstain abstain method abstain method abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain abstain abstain abstain abstain method other method abstain abstain abstain abstain abstain abstain abstain other other other other other other other method abstain objective abstain other abstain other