A gentle tutorial on Bock's algorithm for minimum directed spanning trees with a structured reformulation
This episode reviews the paper 'A gentle tutorial on Bock's algorithm,' which addresses minimum directed spanning trees. Hosts discuss how the method operates using a primal dual style update process and its structural improvements, including a structured reformulation and detailed pseudocode. The discussion concludes by demonstrating its practical application as an exact decoder in dependency parsing for natural language processing.