Such broken and crossing dependencies can be modeled by SDIG if they appear inside a pair of elementary trees.
if they appear between the elementary trees, they are not compatible with the isomorphism assumption on which SDIG is based.