(2010) both rely on locally greedy methods, and in line with all previous works, treat attachment prediction and relation label prediction as independent problems.
they start by computing probabilities of attachments for adjacent pairs of EDUs and greedily select the highest scoring.