Before revision:  the unpooling branch restores the pooled graph to its original resolution such that token-level relation extraction can be performed . Experiments on two  datasets demonstrate the effectiveness of our method, showing significant improvements over previous results .
After revision:  the unpooling branch restores the pooled graph to its original resolution such that token-level relation extraction can be performed . Experiments on two datasets demonstrate the effectiveness of our method, showing significant improvements over prior methods especially when modeling long-term dependencies is necessary. Moreover, we propose Clause Matching (CM), a novel graph pooling method that merges nodes based on dependency relations in graph. CM can largely reduce the graph size while retaining the main semantics of the input text .