It follows from the above assumption that the dependency between any two tokens in q are likely to be the same as the dependency between their corresponding tokens in s. This allows to create a treebank if we can project the dependency from sentences to queries.
since x and y may not be directly connected by a dependency edge in s, we need a method to derive the dependency between x, y ∈ q from the (indirect) dependency between x, y ∈ s. We propose such a method in Section 3.