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 ).
reranking almost always gave some improvement over 1-best parsing.