In Section 5, we then show how the 1-planar dependency parser described in Section 3.3 can be generalized to handle k-planar dependency graphs by introducing additional stacks.
we present a linear-time transition-based parser that is provably correct for 2-planar dependency trees.