Instead of computing the similarity directly as we do for DIRECTSIM, we first transform the representation of the g-phrase in one TEXTCHUNK using a transformation matrix M ∈ R d×d , then compute the match score by inner product and sigmoid activation: Our motivation is that for a TEXTCHUNK relation like clause coherence, the two TEXTCHUNKS need not have any direct similarity.
if we map the representations of TEXTCHUNK S 1 into an appropriate space then we can hope that similarity between these transformed representations of S 1 and the representations of TEXTCHUNK S 2 do yield useful features.