Fixing bound B , no left dependency may exist between child x i and parent x j such that j−i > B (similarly for right dependencies and B r ).
edge-factored parsing runtime is reduced from O(n 3 ) to O(n(B 2 + B 2 r )).