Fortunately, for Bayesian decipherment, we are able to complete the second step efficiently.
for any word W in a bigram, we need only 2|V | lists ("words to the right of W" and "words to the left of W") instead of |V | 2 lists ("pairs of words that surround W").