Comparing conversions of discontinuity in PCFG parsing

This paper compares three different types of representations that resolve long-distance dependency into binary representation as it is required in PCFG parsing. Each conversion is applied to the German TIGER Treebank in the PCFG parsing experiments. The examination of data and the labeled depen-dency evaluation show that the choice of conversion of treebank data in the preprocessing step can influence the F-score up to 2.83 % and that each con-version has its own advantages and limits. The result of this paper shows that this preprocessing step is not trivial in parsing free word order languages.