SMC algorithms maintain a set of weighted hypotheses; the weights correspond to probabilities, and in our case, the hypotheses correspond to target language word sequences.
we approximate the conditional probability, where ω k n is the normalized weight of sample k at word n (ω k n is the unnormalized weight), and δ t k 1:n is a delta function centered at t k 1:n .