biaffine dependency parsing

2024-11-20

$$h_{i}^{head} = FNN^{head}(r_i)$$

$$h_{i}^{dep} = FNN^{dep}(r_i)$$

$$s_{i,j} = Biaff(h_i^{head}, h_j^{dep})$$

$$Biaff(x_1, x_2) = x_1^T U x_2 + W(x_1 \oplus x_2) + b$$

$$ArcScore :: Biaff(x_1, x_2) \rightarrow p^{|toks|}$$

$$LabelScore :: Biaff(x1, x2), pred \rightarrow p^{|labels|}$$

References

• Applying Occam's Razor to Transformer-Based Dependency Parsing: What Works, What Doesn't, and What is Really Necessary