stanojevic / Fast-MST-AlgorithmLinks
Implementation of fast algorithms for Maximum Spanning Tree (MST) parsing that includes fast ArcMax+Reweighting+Tarjan algorithm for single-root dependency parsing.
☆16Updated 2 years ago
Alternatives and similar repositories for Fast-MST-Algorithm
Users that are interested in Fast-MST-Algorithm are comparing it to the libraries listed below
Sorting:
- Code for the paper "Understanding the Mechanics of SPIGOT: Surrogate Gradients for Latent Structure Learning"