Our search algorithm is based on the third-order parsing algorithm, but, the search space is previously shrank by a baseline parser's k-best approximation and a forest pruning algorithm presented in the next section.
(2009) and we apply it to a dependency parser in order to select better candidates with third-order information.