We then demonstrate how the transition system for planar dependency parsing can be generalized to k-planarity by introducing additional stacks.
we define a two-stack system for 2-planar dependency parsing that is provably correct and has linear complexity.