Effective Unsupervised Constrained Text Generation based on Perturbed Masking
Yingwen Fu Wenjie Ou Zhou Yu Yue Lin

Revisiting Out-of-Distribution Detection in LiDAR-based 3D Object Detection

    Michael Kösel^1, Marcel Schreiber^2, Michael Ulrich^2, Claudius Gläser^2 and Klaus Dietmayer^1
	^1Institute of Measurement, Control, and Microtechnology, Ulm University, Germany, {first.last}@uni-ulm.de
    ^2Robert Bosch GmbH, Corporate Research, 71272 Renningen, Germany, {first.last}@de.bosch.com and michael.ulrich2@bosch.com

    April 29, 2024
==============================================================================================================================================================================================================================================================================================================================================



Unsupervised constrained text generation aims to generate text under a given set of constraints without any supervised data. Current state-of-the-art methods stochastically sample edit positions and actions, which may cause unnecessary search steps. In this paper, we propose PMCTG to improve effectiveness by searching for the best edit position and action in each step. Specifically, PMCTG extends perturbed masking technique to effectively search for the most incongruent token to edit. Then it introduces four multi-aspect scoring functions to select edit action to further reduce search difficulty. Since PMCTG does not require supervised data, it could be applied to different generation tasks. We show that under the unsupervised setting, PMCTG achieves new state-of-the-art results in two representative tasks, namely keywords-to-sentence generation and paraphrasing.




§ INTRODUCTION

Constrained text generation is the task of generating text that satisfies a given set of constraints, and it serves many real-world text generation applications, such as dialogue generation <cit.> and summarization <cit.>. There are broadly two types of constraints: Hard constraints such as including a set of given words or phrases in the generated text. Example 1 in Table <ref> shows that the keywords “You” and “beautiful” must occur in the generated sentence. Soft constraints such as acquiring the generated text to be semantically similar to the original text. Example 2 in Table <ref> shows a pair of paraphrases where “What are the effective ways to learn cs?” and “How to learn cs effectively?” share a similar meaning.

Conventional approaches model the task in an encoding-decoding paradigm with a supervised setting <cit.>. However, these methods have certain shortcomings for two constrained generation tasks. For hard constrained text generation, without external constrained means, these methods are difficult to guarantee that the generated text can satisfy all constraints. For soft constrained one, conventional methods treat it as a machine translation (MT) task <cit.> and require massive parallel supervised data for training. Unfortunately, constructing such datasets is resource-intensive. 
In addition, domain-specific supervised models may be difficult to transfer to new domains. <cit.>.



Recently, unsupervised text generation is proposed to address the above challenges. There are mainly two research directions: Beam search-based method aims to generate candidates in order from left to right that satisfy the constraints in each step, inspired by MT methods <cit.>. However, the search space of MT systems is relatively small, while when applied to other generation tasks, such as paraphrase, this approach does not work as optimally as expected because of a much larger search space <cit.>. Local edit-based method represented by CGMH <cit.> and USPA <cit.> is another effective solution. These methods propose stochastic local edit strategies to search for reasonable sentences in a huge search space based on the given constraints. One main concern is that these methods may take a long time to search for the optimal solution because they are based on stochastic strategies. Intuitively, they need more search steps to converge. G2LC <cit.> utilizes gradients to determine edit positions and actions to improve search effectiveness. But it still relies on supervised data.

Dedicated to improving the local edit-based methods, in this paper, we propose a framework PMCTG (Perturbed Masking for Constrained Text Generation) for constrained text generation. PMCTG focuses on controlling the search direction and reducing the search steps by searching for the best edit position and action at each step. Specifically, PMCTG extends perturbed masking <cit.> from a pre-trained BERT model <cit.> to find the best edit position in the sequence. Perturbed masking aims to estimate the correlation between tokens in a sequence, which can be naturally used to find the edit location. We also propose a series of scoring functions for different tasks to select the edit action. PMCTG does not rely on supervised data and only needs a pre-trained BERT model to perform perturbed masking.

We evaluate PMCTG in two constrained text generation tasks, namely keywords-to-sentence generation and paraphrasing. Experimental results show that PMCTG tends to achieve new state-of-the-art performance over multiple baselines. In summary, the contributions are as follows: 

    
  * We extend perturbed masking to constrained text generation which can find edit positions more effectively. 
    
  * We design different scoring functions to select the best action effectively. With different scoring functions, PMCTG can be extended to various generation tasks <cit.>.
    
  * We demonstrate our method's state-of-the-art performance in keywords-to-sentence generation and paraphrasing tasks.





§ RELATED WORK



 §.§ Constrained Text Generation

Constrained text generation is formulated as a supervised sequence-to-sequence problem under the encoding-decoding paradigm <cit.>. For example, <cit.> and <cit.> respectively propose a stacked residual LSTM network and a transformer-based model <cit.>, and <cit.> propose to leverage a combination of variational autoencoders (VAEs) with LSTM models to generate paraphrases. A new sentence generation model is proposed by <cit.>, where a prototype sentence is first extracted from the training corpus and then edited into a new sentence. However, these methods do not support constraint integration  <cit.>. Later, some works have attempted to add constraints to the generated models. <cit.> and <cit.> utilize prefixes to guide the target text generation. <cit.> use pointwise mutual information (PMI) to predict a keyword and treat it as a constraint to generate target text. However, these methods always bind the constraints to the original model and are therefore difficult to apply to new domains and new generation models <cit.>. Moreover, the above approaches rely on an adequate parallel supervised corpus, which is hard to obtain in real-world application scenarios.

Unsupervised constrained text generation has become a research hotspot due to its low training cost and mitigation of insufficient training data. VAEs and their variants <cit.> are leveraged to generate sentences from a continuous latent space. These methods can effectively get rid of the reliance on supervised datasets but remain difficult to control and incorporate generative constraints.

Beam search is a representative approach for unsupervised constrained text generation. Grid Beam Search (GBS) <cit.> is an algorithm that extends beam search by allowing the inclusion of pre-specified lexical constraints. <cit.> propose Dynamic Beam Allocation (DBA), a much faster beam search-based method with hard lexical constraints. <cit.> propose an insertion-based approach consisting of insertion-based generative pre-training and inner-layer beam search. For the tasks where the search space is limited (represented by machine translation), these methods work well. However, when faced with a large search space, they do not work as optimally as expected <cit.>.

Local edit-based methods have attracted attention recently, as they can help to reduce search spaces. CGMH <cit.> applies the Metropolis-Hastings algorithm <cit.> to unsupervised constrained generation. UPSA <cit.> is another local edit-based method. It directly models paraphrasing as an optimization problem and uses simulated annealing to solve it. However, these models may require many steps and running time to generate reasonable sentences since they are based on stochastic strategies. <cit.> proposes a gradient-guided method G2LC that uses token gradients to determine the edit actions and positions, making the generation process more controllable. However, a problem with G2LC is that it still relies on the supervised corpus to train a binary classification model to serve their semantic similarity objective.



 §.§ Perturbed Masking

Perturbed masking <cit.> is a parameter-free probing technique to analyze and interpret pre-trained models. Based on a pre-trained BERT-based model with masked language modeling (MLM) objective, it can measure the impact a token has on predicting another token. It is originally used in syntax-based tasks such as syntactic parsing and discourse dependency parsing. 

In this paper, we extend perturbed masking to constrained text generation. For the edit-based approach edits only one token at each step, we need to find the token with the highest incongruency to edit. Our insight is to use perturbed masking to present the congruency between different tokens. We believe that the token with the weakest correlation with its adjacent tokens has the highest incongruency and thus it is the most probable to edit. Perturbed masking can evaluate the impact of one token on another and a high impact factor means that the token has a high impact on its adjacent tokens and we consider these chunks (the current token with its adjacent tokens) are congruent. Therefore, we can edit the tokens in chunks with low impact to make these chunks more congruent.



§ METHODOLOGY


In this section, we would introduce the proposed PMCTG by first introducing the specific process of using perturbed masking to select edit positions, and then explaining the proposed scoring functions and the use of them to select the edit actions.



 §.§ Edit Position Selection


Most previous works select edit locations stochastically, which lead to many unnecessary search steps. To reduce the search steps, we propose to use perturbed masking <cit.> to sample the edit position. 

Background. Perturbed masking technique is proposed to assess the inter-token information (i.e., the impact one token has on another token in a sequence) based on masked language modeling (MLM). It is originally used for dependency parsing.

Formally, given a sequence with n tokens x={x_i}^n_i=1 and a pre-trained BERT-based model <cit.>  trained with MLM objective, we obtain contextual representations for each token H(x)_i. To quantify the impact a token x_j has on another token x_i, we conduct the following three-step calculation:

    
  * Replace x_i with [MASK] token and feed the new sequence x\{x_i} into BERT, a contextual representation denoted as H(x\{x_i})_i for x_i is obtained.
    
  * Replace x_i and x_j with [MASK] token and feed the new sequence x\{x_i,x_j} into BERT, another contextual representation denoted as H(x\{x_i,x_j})_i for x_i is obtained.
    
  * Given a distance metric d(,), compute the difference between two vectors I(x|x_j,x_i)=d(H(x\{x_i})_i, H(x\{x_i,x_j})_i). Euclidean distance is leveraged in this paper.


I(x|x_j,x_i) indicates the impact x_j has on x_i, where a higher value indicates a high impact, and vice versa. Intuitively, if H(x\{x_i})_i and H(x\{x_i,x_j})_i are similar, it means that the presence or absence of x_j has little effect on the prediction of x_i, thus reflecting the low importance of x_j to x_i.

Position Selection. It is natural to apply perturbed masking to select the edit position for constrained text generation. Based on perturbed masking technique, we compute the edit score for each token in the sequence and then sample the token with the highest score to edit. The token with minimal impact on its adjacent tokens indicates that it has the weakest correlation with adjacent tokens and therefore requires edit. We add the special tokens [CLS] and [SEP] to the original sentence and then use the pre-trained BERT to calculate the edit score for each token:



    ES_i=1-1/2(I(x|x_i,x_i+1)+ I(x|x_i,x_i-1))


Then we can get an edit score vector ES={ES_i}^n_i=0. Later, we feed it into a softmax layer and obtain the edit probabilities:


    p^edit_i = exp(ES_i)/∑_jexp(ES_j)


After that, the p^edit is utilized as the weights to sample the edit position x_e in x where e indicates the edit position index. 



 §.§ Edit Action Selection


After sampling the edit position, next we need to determine the edit action. The three edit actions we focus on are: insert, replace and delete. Specifically, our strategy in this step is to pre-implement the three actions first and then sample the actions based on their action scores. When scoring insertion action, we simply make the equal probability of the front or back of the position for token insertion. We first introduce the scoring functions for different tasks and then explain the edit action selection based on the action scores.



  §.§.§ Scoring Function Design

We propose multiple scoring functions to improve the generated text. Given the initial sentence x_0 with n tokens and the generated sentence x_* with m tokens, the scoring functions include fluency, editorial rationality, semantic similarity, and diversity.

Fluency. The primary condition for a reasonable sentence is fluency, thus we use the average negative log-likelihood to estimate a sentence's fluency based on a forward language model. The score is calculated as: 



    S_flu(x_*)=-1/m∑^m_i=1logp_LM(x_*,i|x_*,<i)



Editorial Rationality. Since the sentence generation process is based on local edits, we further use perturbed masking to design a local edit score for different actions to evaluate their rationality. After a replacement action is executed at index i in x_0, we obtain the sentence x_*={x_0,1, x_0,2, …x_0,i-1, x', x_0,i+1,…,x_0,n}, where x' is the replaced token and m=n. Then we define the edit score as:



    S_edit(x_*)=1/2(I(x_*|x',x_0,i+1)+I(x_*|x',x_0,i-1))



Similarly, after an insertion action, we obtain x_*={x_0,1, x_0,2, …x_0,i, x', x_0,i+1,…,x_0,n}, where x' is the inserted token and m=n+1. The edit score is calculated as:



    S_edit(x_*)=1/2(I(x_*|x',x_0,i+1)+I(x_*|x',x_0,i))



After a deletion action, we obtain x_*={x_0,1, x_0,2, …x_0,i-1, x_0,i+1,…,x_0,n}, where m=n-1. The edit score calculated for deletion is a little different from replacement and insertion action:



    S_edit(x_*)=1/2(I(x_*|x_0,i-1,x_0,i+1)+ 
    
        I(x_*|x_0,i+1,x_0,i-1))



Semantic Similarity. The semantic similarity consists of keyword similarity and sentence similarity. We use KeyBERT <cit.> to extract the keyword set K from x_0. And the pre-trained BERT is leveraged to encode x_0 and x_*, where ik=idx(k) indicates the index of keyword k in x_0. The keyword similarity is defined as finding the closest token in x_* by computing their cosine similarity:



    S_sem,key(x_*,x_0)= 
       1/|K|∑_k∈ Kimax(cos(H(x_0)_ik,H(x_*)_i))



As for the sentence similarity, assuming that H(x) indicates the [CLS] representation in x from BERT and is leveraged to present the whole sentence <cit.>, we define the sentence similarity S_sem,sen(x_*,x_0) as:



    S_sem,sen(x_*,x_0)=cos(H(x_0),H(x_*))



Altogether, the semantic similarity score is:



    S_sem(x_*,x_0)=S_sem,key(x_*,x_0)+S_sem,sen(x_*,x_0)



Diversity. Followed <cit.>, a BLEU-based <cit.> function is adopted to evaluate the expression diversity of the original and generated sentence.



    S_exp(x_*,x_0)=(1-BLEU(x_*,x_0))





  §.§.§ Action Scoring

As mentioned above, after sampling the edit position i, we need to determine the edit action by re-implementing three actions and sampling the actions based on their action scores. We generate the inserted and replaced candidate x' from a language model such as LSTM <cit.> and GPT <cit.>.



    p_candidate=p_LM(x_0,i|x_0,<i)



We use p_candidate as weights to sample x'.After obtaining the edit position i and candidate x', we need to calculate the edit score for each action. We adopt S_flu and S_edit the our scoring function for keywords-to-sentence generation:



    S_hard(x_*)=λ_fluS_flu+λ_editS_edit



and S_flu, S_sem, S_exp and S_edit for paraphrasing:



    S_soft(x_*)=   λ_fluS_flu+λ_editS_edit+ 
       λ_semS_sem+λ_expS_exp



Notably, since different scores are in different magnitudes, they need to be normalized to avoid the dominance of one specific score. After scoring different actions, we use the scores as weights to sample the edit action.



 §.§ Overall Searching Process

With x_0  (given keywords in the keywords-to-sentence generation task or original sentence in the paraphrasing task) as input, we repeat the above steps including edit position selection with perturbed masking and edit action selection with scoring functions for local edit. Until the maximum searching steps, we choose the sentence that achieves the highest score as the final output, according to (<ref>) for keywords-to-sentence generation task or (<ref>) for paraphrasing task respectively.



§ EXPERIMENTS

We evaluate our method on two constrained text generation tasks, namely keywords-to-sentence generation and paraphrasing.



 §.§ Keywords-to-sentence Generation

Experimental Setting. Keywords-to-sentence generation aims to generate a sentence containing the given keywords which is a representative hard constrained text generation task. We conduct keywords-to-sentence generation experiments on the One-Billion-token dataset[http://www.statmt.org/lm-benchmark/] <cit.>. Two language models for generation, namely two-layer LSTM (followed as <cit.>) and GPT <cit.>, are evaluated. Following <cit.>, in order to adapt the language models to the specific domain, we randomly sample 5 million sentences to continually pre-train BERT-based-cased[https://huggingface.co/bert-base-cased] and GPT2[https://huggingface.co/gpt2]. 3 thousand sentences are held out as the test set. 

As for hyperparameters, for each test sentence, we randomly sample 1 to 4 keywords as hard constraints. Following previous works <cit.>, the initial sentence for searching is the concatenation of the keywords. The maximum searching step set in this task is 100. And λ_flu and λ_edit are set as 1 in equation (12). Besides, when the keyword indexes are sampled as edit positions, we directly conduct insert action since the keywords cannot be replaced and deleted.

As for evaluation metrics, the generated target sentence is measured by negative log-likelihood (NLL) loss. NLL is given by a third-party language model which is an n-gram Kneser-Ney language model <cit.> trained in a monolingual English corpus from WMT18[http://www.statmt.org/wmt18/translation-task.html]. In addition to automatic evaluation metrics, we also introduce human evaluation. Specifically, we invite 3 experts who are fluent English speakers to score the generated sentences according to their quality. The score ranges from 0 to 1 with an accuracy of two decimal places, where 1 indicates the best score. The automatic and human evaluation criteria are consistent with previous works <cit.>. The scoring guideline is shown in Table <ref>.






Baseline. We compare our method with several advanced methods:




    
  * sep-B/F <cit.> is a variant of the backward forward model. In sep-B/F, the backward and forward sequences respectively behind and after the keyword are generated separately. It supports only one keyword.
    
  * asyn-B/F <cit.> is similar to sep-B/F. The difference is that the two sequences are generated asynchronously, i.e., the backward sequence is first generated, and then the forward sequence is generated based on the backward one.
    
  * GBS <cit.> is a searching approach that aims to search for a valid solution in the constrained search space of the generator with grid beam search.
    
  * DBA <cit.> is another beam search-based approach with a higher search speed.
    
  * CGMH <cit.> is a stochastic search method based on Metropolis-Hastings sampling.
    
  * G2LC <cit.> is a gradient-guided approach. It improves CGMH by leveraging gradient to decide the edit positions and actions.




Automatic and Human Evaluation Results. Table <ref> shows the performance of multiple methods on keywords-to-sentence generation task. Among different kinds of methods, we can see that the local edit-based methods work better than beam search-based methods, indicating their superior searching ability. CGMH can narrow the search space and make it easy to find higher-quality sentences. G2LC and PMCTG outperform CGMH, which illustrates the importance of determining the correct edit position and action for each step. Exploration and strategies for these two issues can better guide the model to find a more optimal solution, while also greatly reducing the waste of potentially non-essential search steps. Overall, the proposed PMCTG model outperforms other methods on average in both automatic and human evaluation metrics. PMCTG utilizes perturbed masking technology to identify edit locations and reflect the reasonableness of edit actions more intuitively and practically. 

Compared to previous baselines, our approach may either require fewer steps to search for the optimal sentence or equal steps to achieve better results. In this task, our method needs to run only 100 steps while CGMH needs 200 steps for each sample and our method can achieve better results (7.47 vs 7.70 in average NLL). Besides, although G2LC also only needs to run 100 steps for each sample, our method (PMCTG-LSTM) gives better results (7.47 vs 7.56 in average NLL). Although the process requires another BERT model for perturbed masking, we transform a sentence to a batch of vectors and only need to call the BERT model once per search step to calculate the perturbed masking scores for all tokens. Compared to CGMH and UPSA, our method makes full use of each search step to a certain extent, reducing the extra time spent on random strategies. 

Interestingly, PMCTG-LSTM seems to be superior to PMCTG-GPT2 in this task. For one thing, part of the superiority of GPT2 to LSTM is in the semantic richness of the generated sentences. However, in the target dataset, the sentence form and semantics are relatively simple, and therefore the performance of LSTM is comparable to that of GPT2 in cases where there is no need to generate sentences with complex semantics. For another, since keywords are locally ill-formed and semantically distant, the information of keywords may be difficult to support GPT2 to generate reasonable candidates without taking backward probability into account. In contrast, the two-layer LSTM considers both forward and backward probabilities and may be more suitable for generating candidates between two less correlated tokens. 

We find that more keywords may lead to better results, one possible reason is that more keywords can further narrow the search space and facilitate the search of the model.

Case Study. Some generated examples of PMCTG-LSTM are shown in Table <ref>. We observe that the proposed model can generate fluent and meaningful sentences while containing the given keywords.











 §.§ Paraphrasing


Experimental Setting. Paraphrasing aims to convert a sentence to a different surface form but with the same meaning. We evaluate PMCTG on two paraphrase datasets, namely Quora[http://www.statmt.org/wmt18/translation-task.html] and Wikianswers <cit.>. The Quora question pair dataset consists of 140 thousand parallel sentences pairs and 640 thousand non-parallel sentences. The Wikianswers dataset contains 2.3 million question pairs scrawled from the Wikipedia website. We also conduct an experiment on two-layer LSTM (followed as <cit.>) and GPT2 for better comparison. Following previous works <cit.> again, we randomly sample 20 thousand sentences respectively in two datasets as test sets and use the other sentences to continually pre-train BERT-based-cased and GPT2 for domain adaption as <cit.>. 

As for hyperparameters, the maximum searching step set in this task is 50 and λ are all set as 1 in equation (13). The initial sentence for searching is the original sentence in the datasets. 

In terms of evaluation metrics, we leverage the representative metrics sentence-level BLEU <cit.> and ROUGE <cit.> as the basic metrics. In addition, as stated in <cit.>, standard BLEU and ROUGE could not reflect the diversity between the generated and original sentences. Therefore, we adopt iBLEU <cit.> which penalizes the generated sentences with high similarity with the original ones as an additional evaluation metric. Besides, we also invite experts to evaluate the generated paraphrases. Specifically, we sample 300 sentences from the Quora test set and ask 3 experts to score each sentence according to two aspects: relevance and fluency. The evaluation criterion is again consistent with the previous works <cit.>. The scoring guidelines are shown in Table <ref> and Table <ref>.



Baseline. We compare our methods with three types of baseline:





    
  * Supervised methods are original sequence-to-sequence models trained in in-domain supervised data, including ResidualLSTM <cit.>, VAE-SVG-eq <cit.>, Pointer-generator <cit.>, the Transformer <cit.>, and DNPG (the decomposable neural paraphrase generation) <cit.>.
    
  * Domain-adapted supervised methods train models in one domain and then adapt them to another domain, including shallow fusion <cit.> and multi-task learning (MTL) method <cit.>.
    
  * Unsupervised methods that are free of any supervised data and easily adapted to multiple new domains, including VAE <cit.>, CGMH <cit.>, UPSA <cit.>, and the recurrent state-of-the-art method G2LC <cit.>. Notably, G2LC has two variants of G2LC-Generator and G2LC-Recognizer.


Automatic Evaluation Results. Table <ref> presents the results of multiple methods on the paraphrasing task. From the first part of Table <ref>, we can see that supervised methods significantly outperform the other two kinds of methods. The supervised models were trained on 100 thousand question pairs for Quora and 500 thousand question pairs for Wikianswers. Their superiority indicates the effectiveness of learning knowledge from massive parallel data. However, such in-domain supervised data is hard to obtain in real-world applications.

Besides, the second section of Table <ref> shows the domain-adapted supervised models' performance. These models are trained in one domain (Quora or Wikianswers) and then evaluated in another domain (Wikianswers or Quora). Their performances are much lower than in-domain supervised models' performances. This demonstrates the poor generalizability of supervised models and calls for the need for unsupervised methods.

The last section of Table <ref> shows the results of multiple unsupervised methods. VAE seems to work worst on both datasets, which suggests that paraphrasing by latent space sampling performs not as well as local edit methods. PMCTG achieves the best performance in most cases, which indicates the effectiveness of PMCTG again. Unsupervised PMCTG does not require parallel data and can easily generalize to new domains, thus some unsupervised methods tend to achieve higher performance than the domain-adapted supervised models. In addition, it is worthwhile to note that the performance of some unsupervised methods (UPSA, G2LC, and PMCTG) is even better than some supervised methods (Residual LSTM and VAE-SVG-eq), which indicates that the gap between supervised and unsupervised methods has narrowed due to the effective searching strategies of the local edit-based methods. In addition, different from the keywords-to-sentence generation task, GPT2 works better than two-layer LSTM in the paraphrasing task. We believe that given a partially fluent text, GPT2 can generate more reasonable candidates due to its powerful language modeling capability.



Human Evaluation Results. From Table <ref>, we show PMCTG-GPT2 achieves state-of-the-art performance in terms of fluency, but still suffers from relevance. We plan to improve its relevance in future research.



Case Study. Table <ref> lists some representative generated examples from PMCTG-GPT2. They show the four most common types of paraphrasing for the proposed method. The first type is the change of syntax such as the interchange of “what can…” and “how to…” as in the first example. The second type is the change of adjective such as the second example where the “possible” is changed into “good”. The third type is the change of personal pronouns such as the interchange of “you” and “I” in the third example. The last type is the change of tense, the most common is the interchange of general past tense and general present tense as the last example. In general, one limitation of the proposed model is the relatively low expressive diversity of generated sentences. One possible reason is that since each search step modifies only one token, and the unit of conversion from one expression to another is usually phrases or sentence blocks, thus the model may be biased not to search in that direction.



§ CONCLUSION

We propose a method PMCTG to improve the previous stochastic searching methods in the topic of unsupervised constrained generation. PMCTG leverages perturbed masking technique to find the best edit position and leverages newly designed multiple scoring functions to decide the best edit action. We evaluate the proposed method on two representative tasks: keywords-to-sentence generation (hard constraints) and paraphrasing (soft constraints). Experimental results demonstrate the effectiveness of the proposed method which achieves competitive results on three datasets over multiple advanced baseline methods. We plan to improve the diversity and relevance of the generated sentences in future work.



§ ACKNOWLEDGEMENT

We are grateful for the inspiration and project support from "The World 3" in NetEase Games. We also thank anonymous reviewers for their comments and suggestions.






acl_natbib

