Our goal is to apply compressed dependency tree to extract explicit relation between predicate and argument as precise as possible for SRL purpose.
we construct the compressed tree by identifying predicate-argument units and then re-linking them if there exist dependency relation among them.