We therefore modify the two CRFs into slidingwindow versions.
at each level, when decoding a constituent sequence, for each hidden structure node l i or relation node r i , we find all windows of constituents that contain the hidden node, and set the hidden node's label according to the window with the maximum joint probability.