Greedy, Joint Syntactic-Semantic Parsing with Stack LSTMs
Table 2: Joint parsers: comparison on the CoNLL 2008 test (WSJ+Brown) set.
['[BOLD] Model', '[BOLD] LAS', '[BOLD] Sem.', '[BOLD] Macro']
Our joint model significantly outperforms the joint model of \newciteHenderson:08, from which our set of transitions is derived, showing the benefit of learning a representation for the entire algorithmic state. The best reported systems on the CoNLL 2008 task are due to \newciteJohansson:08, \newciteChe:08, \newciteCiaramita:08 and \newciteZhao:08, all of which pipeline syntax and semantics; our system’s semantic and overall performance is comparable to these. We fall behind only \newciteJohansson:08, whose success was attributed to carefully designed global SRL features integrated into a pipeline of classifiers, making them asymptotically slower.