Approximating CKY with Transformers
Submission Type: Regular Long Paper
Submission Track: Syntax, Parsing and their Applications
Submission Track 2: Machine Learning for NLP
Keywords: transformer, algorithmic reasoning, dynamic programming, constituency parsing
TL;DR: We investigate the ability of transformer models to learn the CKY algorithm.
Abstract: We investigate the ability of transformer models to approximate the CKY algorithm, using them to directly predict a sentence's parse and thus avoid the CKY algorithm's cubic dependence on sentence length. We find that on standard constituency parsing benchmarks this approach achieves competitive or better performance than comparable parsers that make use of CKY, while being faster. We also evaluate the viability of this approach for parsing under \textit{random} PCFGs. Here we find that performance declines as the grammar becomes more ambiguous, suggesting that the transformer is not fully capturing the CKY computation. However, we also find that incorporating additional inductive bias is helpful, and we propose a novel approach that makes use of gradients with respect to chart representations in predicting the parse, in analogy with the CKY algorithm being a subgradient of a partition function variant with respect to the chart.
Submission Number: 2275
Loading