On the other hand, for the task of finding the best string among a pool candidates, we do not need to compute (or approximate) the denominator in equation 13, since As in the case for paths, the language L(Y ) is usually infinitely large.
given an output candidate y k ∈ L ⊆ L(Y ), we can approximate the summation in equation (14) using importance sampling: Algorithm 2 Training procedure for G θ .