| Dependency Parsing: Baseline | 4.2 Parsing using 3 Beam Search Algorithm |
| Dependency Parsing: Baseline | We use a beam search algorithm to find the object parsing action sequence. |
| Evaluation Results | beam search algorithm with width 5 is used for parsing, otherwise, a simple shift-reduce decoding is used. |
| Evaluation Results | +d 0.861 0.870 “+d: using three Markovian features preact and beam search decoding. |
| Treebank Translation and Dependency Transformation | A beam search algorithm is used for this process to find the best path from all the translation options; As the training stage, especially, the most time-consuming alignment substage, is skipped, the translation only includes a decoding procedure that takes about 4.5 hours for about one million words of the PTB in a 2.8GHz PC. |