学习ACL2022
论文地址：https://arxiv.org/abs/2108.04750
code地址：
https://github.com/sustcsonglin/span-based-dependency-parsing
这个论文确实不错建议阅读：
We propose a new method for projective dependency parsing based on headed spans. In a projective dependency tree, the largest subtree rooted at each word covers a contiguous sequence (i.e., a span) in the surface order. We call such a span marked by a root word \textit{headed span}.
A projective dependency tree can be represented as a collection of headed spans. We decompose the score of a dependency tree into the scores of the headed spans and design a novel O(n3) dynamic programming algorithm to enable global training and exact inference. Our model achieves state-of-the-art or competitive results on PTB, CTB, and UD. Our code is publicly available at \url{this https URL}.
升级：
Combining (second-order) graph-based and headed-span-based projective dependency parsing
