In this work, we first use reward values defined by negative Hamming distance and then re-weight the reward based on entailment reward s(x, y, y * ).
given a sentence y * of length , we count the number of sentences within an edit distance d, where d ∈ {0, .