For example, the supertag predictions for some words can contribute to high supertagging accuracy, but cause the parser to fail.
considering the global grammar constraints in the supertagging training stage can make the supertagger and the Algorithm 1: Forest-guided supertagger training Input: Generate supertag lattice using the point-wise classifier with current θ 5: Selectŝ i from the lattice which can construct a tree with largest sequence score 6: θ sum ← θ sum + θ i+1 Return: θ sum /N T parser more tightly related, which will contribute towards the performance of the parser.