A gentle tutorial and a structured reformulation of Bock's algorithm for minimum directed spanning trees

2026-03-29

AI Summary

This work addresses the limited accessibility and reproducibility of Bock’s original 1971 algorithm for non-projective dependency parsing, which has hindered its adoption due to its obscure exposition and unclear structure. By performing a line-by-line analysis of the original algorithm, the study provides the first complete execution trace on Bock’s canonical ten-node example and introduces a structured reformulation that explicitly delineates phase structure, state maintenance, and control flow. Furthermore, it unifies the presentation by transforming the maximum-weight arborescence problem into an equivalent minimum-cost formulation via an affine transformation. The resulting reconstruction not only enables full reproducibility and visualization of Bock’s algorithm but also confirms its correctness as an exact decoder for non-projective dependency graphs, substantially enhancing its readability, pedagogical utility, and potential for modern applications.

Abstract

This paper presents a gentle tutorial and a structured reformulation of Bock's 1971 Algol procedure for constructing minimum directed spanning trees. Our aim is to make the original algorithm readable and reproducible for modern readers, while highlighting its relevance as an exact decoder for nonprojective graph based dependency parsing. We restate the minimum arborescence objective in Bock's notation and provide a complete line by line execution trace of the original ten node example, extending the partial trace given in the source paper from initialization to termination. We then introduce a structured reformulation that makes explicit the procedure's phase structure, maintained state, and control flow, while preserving the logic of the original method. As a further illustration, we include a worked example adapted from {jurafsky-martin-2026-book} for dependency parsing, showing how a maximum weight arborescence problem is reduced to Bock's minimum cost formulation by a standard affine transformation and traced under the same state variables.

Problem

• minimum directed spanning tree
• Bock's algorithm
• dependency parsing
• arborescence
• algorithm reproducibility

Innovation

• minimum directed spanning tree
• Bock's algorithm
• structured reformulation
• dependency parsing
• arborescence