English
Related papers

Related papers: Transition-based Bubble Parsing: Improvements on C…

200 papers

This thesis presents a broad-coverage probabilistic top-down parser, and its application to the problem of language modeling for speech recognition. The parser builds fully connected derivations incrementally, in a single pass from…

Computation and Language · Computer Science 2007-05-23 Brian Roark

We propose the Graph2Graph Transformer architecture for conditioning on and predicting arbitrary graphs, and apply it to the challenging task of transition-based dependency parsing. After proposing two novel Transformer models of…

Computation and Language · Computer Science 2021-03-22 Alireza Mohammadshahi , James Henderson

We propose a method for non-projective dependency parsing by incrementally predicting a set of edges. Since the edges do not have a pre-specified order, we propose a set-based learning method. Our method blends graph, transition, and…

Machine Learning · Computer Science 2019-10-25 Sean Welleck , Kyunghyun Cho

Predicting linearized Abstract Meaning Representation (AMR) graphs using pre-trained sequence-to-sequence Transformer models has recently led to large improvements on AMR parsing benchmarks. These parsers are simple and avoid explicit…

Computation and Language · Computer Science 2021-11-01 Jiawei Zhou , Tahira Naseem , Ramón Fernandez Astudillo , Young-Suk Lee , Radu Florian , Salim Roukos

While concept-based interpretability methods have traditionally focused on local explanations of neural network predictions, we propose a novel framework and interactive tool that extends these methods into the domain of mechanistic…

Machine Learning · Computer Science 2025-07-09 Sofiia Chorna , Kateryna Tarelkina , Eloïse Berthier , Gianni Franchi

This paper presents a novel treebank-driven approach to comparing syntactic structures in speech and writing using dependency-parsed corpora. Adopting a fully inductive, bottom-up method, we define syntactic structures as delexicalized…

Computation and Language · Computer Science 2026-02-24 Kaja Dobrovoljc

We describe an attentive encoder that combines tree-structured recursive neural networks and sequential recurrent neural networks for modelling sentence pairs. Since existing attentive models exert attention on the sequential structure, we…

Computation and Language · Computer Science 2016-10-11 Yao Zhou , Cong Liu , Yan Pan

Expressive text encoders such as RNNs and Transformer Networks have been at the center of NLP models in recent work. Most of the effort has focused on sentence-level tasks, capturing the dependencies between words in a single sentence, or…

Computation and Language · Computer Science 2021-09-15 Manuel Widmoser , Maria Leonor Pacheco , Jean Honorio , Dan Goldwasser

This study evaluates the performance of Recurrent Neural Network (RNN) and Transformer models in replicating cross-language structural priming, a key indicator of abstract grammatical representations in human language processing. Focusing…

Computation and Language · Computer Science 2024-10-17 Demi Zhang , Bushi Xiao , Chao Gao , Sangpil Youm , Bonnie J Dorr

Higher-order methods for dependency parsing can partially but not fully address the issue that edges in dependency trees should be constructed at the text span/subtree level rather than word level. In this paper, we propose a new method for…

Computation and Language · Computer Science 2022-05-24 Leilei Gan , Yuxian Meng , Kun Kuang , Xiaofei Sun , Chun Fan , Fei Wu , Jiwei Li

Language models based on the Transformer architecture achieve excellent results in many language-related tasks, such as text classification or sentiment analysis. However, despite the architecture of these models being well-defined, little…

Computation and Language · Computer Science 2025-04-14 Miguel López-Otal , Jorge Gracia , Jordi Bernad , Carlos Bobed , Lucía Pitarch-Ballesteros , Emma Anglés-Herrero

Recent work on the problem of latent tree learning has made it possible to train neural networks that learn to both parse a sentence and use the resulting parse to interpret the sentence, all without exposure to ground-truth parse trees at…

Computation and Language · Computer Science 2018-02-27 Adina Williams , Andrew Drozdov , Samuel R. Bowman

The neural architectures of language models are becoming increasingly complex, especially that of Transformers, based on the attention mechanism. Although their application to numerous natural language processing tasks has proven to be very…

Computation and Language · Computer Science 2023-12-04 Pablo Gamallo

The dependency tree of a natural language sentence can capture the interactions between semantics and words. However, it is unclear whether those methods which exploit such dependency information for semantic parsing can be combined to…

Computation and Language · Computer Science 2021-12-28 Defeng Xie , Jianmin Ji , Jiafei Xu , Ran Ji

We present a new framework for compositional distributional semantics in which the distributional contexts of lexemes are expressed in terms of anchored packed dependency trees. We show that these structures have the potential to capture…

Computation and Language · Computer Science 2016-08-26 David Weir , Julie Weeds , Jeremy Reffin , Thomas Kober

In this paper, we propose a novel lightweight relation extraction approach of structural block driven - convolutional neural learning. Specifically, we detect the essential sequential tokens associated with entities through dependency…

Computation and Language · Computer Science 2021-03-23 Dongsheng Wang , Prayag Tiwari , Sahil Garg , Hongyin Zhu , Peter Bruza

Sequence-based neural networks show significant sensitivity to syntactic structure, but they still perform less well on syntactic tasks than tree-based networks. Such tree-based networks can be provided with a constituency parse, a…

Computation and Language · Computer Science 2020-05-04 Michael A. Lepori , Tal Linzen , R. Thomas McCoy

We investigate the extent to which modern, neural language models are susceptible to structural priming, the phenomenon whereby the structure of a sentence makes the same structure more probable in a follow-up sentence. We explore how…

Computation and Language · Computer Science 2022-06-30 Arabella Sinclair , Jaap Jumelet , Willem Zuidema , Raquel Fernández

Neural networks with tree-based sentence encoders have shown better results on many downstream tasks. Most of existing tree-based encoders adopt syntactic parsing trees as the explicit structure prior. To study the effectiveness of…

Computation and Language · Computer Science 2018-08-30 Haoyue Shi , Hao Zhou , Jiaze Chen , Lei Li

We present a memory-based model for context-dependent semantic parsing. Previous approaches focus on enabling the decoder to copy or modify the parse from the previous utterance, assuming there is a dependency between the current and…

Computation and Language · Computer Science 2021-10-15 Parag Jain , Mirella Lapata