This observation indicates that our restricted grammar implicitly binarizes a dependency tree, and the incurred stack depth (or the degree of center-embedding) is determined based on the structure of the binarized tree.
we can show that the presented grammar performs optimal binarization; i.e., it minimizes the incurred stack depth.