The input to MAGE-GRU is no longer a sequence of words but a directed acyclic graph in which the word sequence is augmented with edges between arbitrarily distant words for which external knowledge suggests some explicit signals such as antonymy.
"loss" and "profit" in the example above are directly connected, making a downstream network layer more easily classify the discourse relation.