, n} be an (unordered) set containing precisely all syntax paths for the words in s. Then the syntax tree of s can be uniquely recovered by R. In the lemma, we note that R is an unordered set.
regardless of the ordering of the paths in R, one can always recover the syntax tree from R. Let r(w) be the syntax path of a word w in the sentence s of interest.