One nice property of this annotation schema is that the structure for an event is guaranteed to be a tree because each tuple field has at most one parent and there are no loops due to the total order between fields.
we can treat the event detection task as a dependency parsing problem, as discussed in Section 4.2.