CLLGFeb 5, 2020

Parsing as Pretraining

arXiv:2002.01685v133 citations
AI Analysis

This work addresses the gap in probing frameworks for syntax modeling with pretrained encoders, offering a novel approach for parsing tasks.

The paper tackled the problem of using pretrained language model encoders for full constituent and dependency parsing without decoding, achieving state-of-the-art results with 93.5% F1 on PTB and 78.8% LAS on EN-EWT UD.

Recent analyses suggest that encoders pretrained for language modeling capture certain morpho-syntactic structure. However, probing frameworks for word vectors still do not report results on standard setups such as constituent and dependency parsing. This paper addresses this problem and does full parsing (on English) relying only on pretraining architectures -- and no decoding. We first cast constituent and dependency parsing as sequence tagging. We then use a single feed-forward layer to directly map word vectors to labels that encode a linearized tree. This is used to: (i) see how far we can reach on syntax modelling with just pretrained encoders, and (ii) shed some light about the syntax-sensitivity of different word vectors (by freezing the weights of the pretraining network during training). For evaluation, we use bracketing F1-score and LAS, and analyze in-depth differences across representations for span lengths and dependency displacements. The overall results surpass existing sequence tagging parsers on the PTB (93.5%) and end-to-end EN-EWT UD (78.8%).

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes