English
Related papers

Related papers: Arc-Standard Spinal Parsing with Stack-LSTMs

200 papers

Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification…

Machine Learning · Statistics 2021-05-31 Yaniv Tenzer , Amit Moscovich , Mary Frances Dorn , Boaz Nadler , Clifford Spiegelman

Dependency parsing research, which has made significant gains in recent years, typically focuses on improving the accuracy of single-tree predictions. However, ambiguity is inherent to natural language syntax, and communicating such…

Computation and Language · Computer Science 2018-04-18 Katherine A. Keith , Su Lin Blodgett , Brendan O'Connor

Syntactic parsing is essential in natural-language processing, with constituent structure being one widely used description of syntax. Traditional views of constituency demand that constituents consist of adjacent words, but this poses…

Computation and Language · Computer Science 2024-10-14 Lukas Mielczarek

This paper presents a fundamental algorithm for parsing natural language sentences into dependency trees. Unlike phrase-structure (constituency) parsers, this algorithm operates one word at a time, attaching each word as soon as it can be…

Computation and Language · Computer Science 2025-10-24 Michael A. Covington

We treat projective dependency trees as latent variables in our probabilistic model and induce them in such a way as to be beneficial for a downstream task, without relying on any direct tree supervision. Our approach relies on Gumbel…

Computation and Language · Computer Science 2019-06-25 Caio Corro , Ivan Titov

We study compositional generalization, viz., the problem of zero-shot generalization to novel compositions of concepts in a domain. Standard neural networks fail to a large extent on compositional learning. We propose Tree Stack Memory…

Machine Learning · Computer Science 2020-10-19 Forough Arabshahi , Zhichu Lu , Pranay Mundra , Sameer Singh , Animashree Anandkumar

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

Recent advances in Neural Machine Translation (NMT) show that adding syntactic information to NMT systems can improve the quality of their translations. Most existing work utilizes some specific types of linguistically-inspired tree…

Computation and Language · Computer Science 2018-08-29 Xinyi Wang , Hieu Pham , Pengcheng Yin , Graham Neubig

Modern task-oriented semantic parsing approaches typically use seq2seq transformers to map textual utterances to semantic frames comprised of intents and slots. While these models are empirically strong, their specific strengths and…

Computation and Language · Computer Science 2021-05-31 Shrey Desai , Ahmed Aly

We introduce a tree-structured attention neural network for sentences and small phrases and apply it to the problem of sentiment classification. Our model expands the current recursive models by incorporating structural information around a…

Computation and Language · Computer Science 2017-01-10 Filippos Kokkinos , Alexandros Potamianos

We propose a neural sequence-to-sequence model for direction following, a task that is essential to realizing effective autonomous agents. Our alignment-based encoder-decoder model with long short-term memory recurrent neural networks…

Computation and Language · Computer Science 2015-12-18 Hongyuan Mei , Mohit Bansal , Matthew R. Walter

Natural languages are believed to be (mildly) context-sensitive. Despite underpinning remarkably capable large language models, transformers are unable to model many context-free language tasks. In an attempt to address this limitation in…

Computation and Language · Computer Science 2024-05-15 Jiaoda Li , Jennifer C. White , Mrinmaya Sachan , Ryan Cotterell

In principle, the design of transition-based dependency parsers makes it possible to experiment with any general-purpose classifier without other changes to the parsing algorithm. In practice, however, it often takes substantial software…

Computation and Language · Computer Science 2012-11-02 Alex Rudnick

The input to a neural sequence-to-sequence model is often determined by an up-stream system, e.g. a word segmenter, part of speech tagger, or speech recognizer. These up-stream models are potentially error-prone. Representing inputs through…

Computation and Language · Computer Science 2017-07-24 Matthias Sperber , Graham Neubig , Jan Niehues , Alex Waibel

We study the problem of using (partial) constituency parse trees as syntactic guidance for controlled text generation. Existing approaches to this problem use recurrent structures, which not only suffer from the long-term dependency problem…

Computation and Language · Computer Science 2020-10-06 Yinghao Li , Rui Feng , Isaac Rehg , Chao Zhang

Recent works show that discourse analysis benefits from modeling intra- and inter-sentential levels separately, where proper representations for text units of different granularities are desired to capture both the meaning of text units and…

Computation and Language · Computer Science 2022-05-05 Yifei Zhou , Yansong Feng

The ultimate goal of most scientific studies is to understand the underlying causal mechanism between the involved variables. Structural causal models (SCMs) are widely used to represent such causal mechanisms. Given an SCM, causal queries…

Machine Learning · Statistics 2025-03-21 Beate Sick , Oliver Dürr

State-of-the-art LSTM language models trained on large corpora learn sequential contingencies in impressive detail and have been shown to acquire a number of non-local grammatical dependencies with some success. Here we investigate whether…

Computation and Language · Computer Science 2019-04-09 Ethan Wilcox , Peng Qian , Richard Futrell , Miguel Ballesteros , Roger Levy

When trained on language data, do transformers learn some arbitrary computation that utilizes the full capacity of the architecture or do they learn a simpler, tree-like computation, hypothesized to underlie compositional meaning systems…

Computation and Language · Computer Science 2022-11-07 Shikhar Murty , Pratyusha Sharma , Jacob Andreas , Christopher D. Manning

Both syntactic and semantic structures are key linguistic contextual clues, in which parsing the latter has been well shown beneficial from parsing the former. However, few works ever made an attempt to let semantic parsing help syntactic…

Computation and Language · Computer Science 2020-10-08 Junru Zhou , Zuchao Li , Hai Zhao