Papers › Graph Convolution over Pruned Dependency Trees Improves Relation Extraction
Graph Convolution over Pruned Dependency Trees Improves Relation Extraction
Yuhao Zhang, Peng Qi, Christopher D. Manning
Dependency trees help relation extraction models capture long-range relations between words. However, existing dependency-based models either neglect crucial information (e.g., negation) by pruning the dependency trees too aggressively, or are computationally inefficient because it is difficult to parallelize over different tree structures. We propose an extension of graph convolutional networks that is tailored for relation extraction, which pools information over arbitrary dependency structures efficiently in parallel. To incorporate relevant information while maximally removing irrelevant content, we further apply a novel pruning strategy to the input trees by keeping words immediately around the shortest path between the two entities among which a relation might hold. The resulting model achieves state-of-the-art performance on the large-scale TACRED dataset, outperforming existing sequence and dependency-based neural models. We also show through detailed analysis that this model has complementary strengths to sequence models, and combining them further improves the state of the art.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
1 archive task tag without a task page not shown.
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Relation Classification | TACRED | C-GCN | F1 | 66.4 | #5 of 17 | Archive leaderboard | report |
| Relation Extraction | Re-TACRED | C-GCN | F1 | 80.3 | #6 of 9 | Archive leaderboard | report |
| Relation Extraction | TACRED | C-GCN + PA-LSTM | F1 | 68.2 | #26 of 40 | Archive leaderboard | report |
| Relation Extraction | TACRED | GCN + PA-LSTM | F1 | 67.1 | #33 of 40 | Archive leaderboard | report |
| Relation Extraction | TACRED | C-GCN | F1 | 66.4 | #35 of 40 | Archive leaderboard | report |
| Relation Extraction | TACRED | GCN | F1 | 64.0 | #38 of 40 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections