The binary tree is composed of a set of triplets in the form of (p → c 1 c 2 ), where p is a parent vector and c 1 and c 2 are children vectors of p. Each child can be either an input word vector or a multi-word vector.
the tree in Figure 2 can be represented as three triplets: In Figure 1, we use recursive autoencoders to generate vector space representations for Chinese and English phrases, which form the atomic blocks for further block merging.