... de-composed through Singular Value Decomposition(SVD) (Landauer and Dumais, 1997; Golub and Ka-han, 1965) into the product of three new matrices:U, S, and V so that S is diagonal and M = ... two nodes n1 and n2 and appliesa different similarity for each node type. The latter isderived by τ and can be: GR (i.e., SYNT), POS- Tag(i.e., POS) or a lexical (i.e., LEX) type. In our exper-iment, ... between the nodes and (iii) the depen-dency labels, e.g., grammatical functions (GR), and POS- Tags, again as tree nodes. We designed twodifferent tree types: (i) in the first type, GR are cen-tral...