Therefore, to reduce computation complexity during Gibbs sampling, we approximate the values of {z ij , s ij | i = j} by the topic/sense (z jj , s jj ) that are generated from window v j .
in Gibbs sampling, the algorithm does not actually sample the values of {z ij , s ij , | i = j}; instead, it directly assumes the sampled values are z jj , s jj .