SOTAVerified

From Partial to Strictly Incremental Constituent Parsing

2024-02-05Code Available0· sign in to hype

Ana Ezquerro, Carlos Gómez-Rodríguez, David Vilares

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We study incremental constituent parsers to assess their capacity to output trees based on prefix representations alone. Guided by strictly left-to-right generative language models and tree-decoding modules, we build parsers that adhere to a strong definition of incrementality across languages. This builds upon work that asserted incrementality, but that mostly only enforced it on either the encoder or the decoder. Finally, we conduct an analysis against non-incremental and partially incremental models.

Tasks

Reproductions