Convolution To capture the local features around each node of the dependency path, we consider a fixed size window of nodes around each node in the window processing component, producing a matrix of node features of fixed size d w × 1, where d w = d × w and w is the window size.
in this paper, we propose to learn more robust relation representations from shortest dependency paths through a convolution neural network.