This preserves the three properties in the definition of tree decomposition (Definition 1).
with string-to-graph parsing, dependency semantic parsing does not require any hardwired input grammar generating a set of valid graphs.