The complexity of naive spanning is θ(n 2 ), 1 because it does nothing to explore the topological properties of a linguistic structure.
the naive graphspanning idea does not fully take advantages of the greedy search of the transitionbased parsing architecture.