In this work, we make a naive assumption that two neighboring sentences share a "common root".
a cross-sentence dependency path can be represented as two shortest dependency path branches from the ends to the "common root", as shown in Figure 2.