On the other hand, it can be imagined that the set of values {z ij , s ij |j − /2 ≤ i ≤ j + /2} in different windows v i should roughly be the same, since they are hidden values for the same word w j .
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 .