Hence for comparison we trained another parser using automatically generated POS tags obtained from 10-fold cross validation, but did not find significant difference between these two parsers when testing on the perfectly segmented development dataset.
output: Word sequence, PoS tag sequence, and parse tree 0: ∀0 ≤ i ≤ j ≤ l − 1, calculate score seg (x, i, j) using Equation 11: For each character boundary b i , 0 ≤ i ≤ l, get the best previous and next words of b i using bidirectional Viterbi decoding 2: ∀0 ≤ i ≤ j ≤ l − 1, t ∈ T , calculate score seg⊕pos (x, i, j, t) using Equation 23: ∀b i , 0 ≤ i ≤ l, t ∈ T , get the best PoS tags of words left/right to b i using bidirectional viterbi decoding.