This enables us to optimize for delayed rewards that are non-decomposable.
we directly minimize a distance function between strings, e.g., Levenshtein distance, by using negative distance as a delayed reward: 1 R(Ŷ ) = −Levenshtein(Y,Ŷ ).