Given the syntactic graph G = (V, E), we take the embedding generation process for node v ∈ V as an example to explain the node embedding generation algorithm 1 : (1) We first transform node v's text attribute to a feature vector, a v , by looking up the embedding matrix W e ; (2) The neighbors of v are categorized into forward neighbors N (v) and backward neighbors N (v) according to the edge direction.
n (v) returns the nodes that v directs to and n (v) returns the nodes that direct to v; (3) We aggregate the forward representations of , where k∈{1, ..., K} is the iteration index.