Therefore, the parser needs to add all possible relation attachment actions (nearly half of the action space) into the valid action set as long as cause-01 exists in the stack, which makes the parser harder to train.
we define several properties that the compact graph should respect to further refine the search space 4 : • Acyclicity: cycles are forbidden.