This yields a directed acyclic graph that expresses various relations among words.
the fact that SDP structures are directed acyclic graphs means that we cannot apply standard dependency parsing algorithms to SDP.