That is, 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.
r(w) can be written as the sequence (t , where L is the number of nodes in the path r, and each t i is a syntax token.