For K = 50, we also use r 1 = 17.
in each iteration, given the assignment A obtained from the previous iteration, one first computes the latent descriptors for all word types as defined above, and then proceeds in the usual way to update cluster centroids and to find a new assignment A to be used in the next iteration.