This process is illustrated in Figure 1, with actual examples included and word embeddings indicated as vectors with dots.
the method works as shown in Algorithm 1 for n distinct classes, k most frequent terms to be incorporated as cluster and normalized term frequency (i.e., Bag-of-words, B ij ) threshold t. A more detailed description is given underneath the algorithm.