paper-with-me

Papers

From Partial to Strictly Incremental Constituent Parsing

2024-02-05 · Ana Ezquerro, Carlos Gómez-Rodríguez, David Vilares

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.

📄 PDF Abstract BibTeX arXiv:2402.02782

Code (1)

anaezquerro/incpar 공식 구현 pytorch

Tasks

Decoder

Similar Papers 제목 키워드 기반

Can Discourse Relations be Identified Incrementally?

2017-11-01 · IJCNLP 2017 11 · Frances Yung, Hiroshi Noji, Yuji Matsumoto

Humans process language word by word and construct partial linguistic structures on the fly before the end of the sentence is perceived. Inspired by this cognitive ability, incremental algorithms for natural language pro…

Discourse ParsingLanguage ModelingLanguage ModellingSemantic Role Labeling+2

Shift-Reduce Constituent Parsing with Neural Lookahead Features

2016-12-02 · TACL 2017 1 · Jiangming Liu, Yue Zhang

Transition-based models can be fast and accurate for constituent parsing. Compared with chart-based models, they leverage richer features by extracting history information from a parser stack, which spans over non-local …

Sentence

On the Challenges of Fully Incremental Neural Dependency Parsing

2023-09-28 · Ana Ezquerro, Carlos Gómez-Rodríguez, David Vilares

Since the popularization of BiLSTMs and Transformer-based bidirectional encoders, state-of-the-art syntactic parsers have lacked incrementality, requiring access to the whole sentence and deviating from human language pr…

Dependency ParsingSentence

Language Independent Dependency to Constituent Tree Conversion

2016-12-01 · COLING 2016 12 · Young-suk Lee, Zhiguo Wang

We present a dependency to constituent tree conversion technique that aims to improve constituent parsing accuracies by leveraging dependency treebanks available in a wide variety in many languages. The technique works i…

CCG Parsing Algorithm with Incremental Tree Rotation

2019-06-01 · NAACL 2019 6 · Milo{\v{s}} Stanojevi{\'c}, Mark Steedman

The main obstacle to incremental sentence processing arises from right-branching constituent structures, which are present in the majority of English sentences, as well as optional constituents that adjoin on the right, …

Sentence