Given the decomposed C T , we compute a centroid as the average m of all sentence vectors of a corpus: The Euclidean distance to the center is then taken as an indicator of the degree of humor.
given two sentences s 1 and s 2 and their embeddings x 1 and With the lexical similarity captured by tensor embeddings, we can build a similarity graph, and use a label propagation algorithm (Zhou et al., 2003) for semi-supervised humor recognition.