Controllable Paraphrase Generation with a Syntactic Exemplar
Table 9: Test results with decoder variants.
['[EMPTY]', 'BL', 'R-1', 'R-2', 'R-L', 'MET', 'ST']
For init, we use the concatenation of semantic variable y and syntactic variable z for computing the initial hidden state of decoder and then use the word embedding as input and hidden state to predict the next word. For concat, we move both y and z to the input of the decoder and use the concatenation of these two variables as input to the decoder and use the hidden state for predicting the next word. For swap, we swap the position of y and z to use the concatenation of y and word embeddings as input to the decoder and the concatenation of z and hidden states as output for predicting the next word. init performs the worst across the three settings. Both concat and swap have variables in each time step in the decoder, which improves performance. swap arranges variables in different positions in the decoder and further improves over concat in all metrics.