English
Related papers

Related papers: ListOps: A Diagnostic Dataset for Latent Tree Lear…

200 papers

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

Recent latent tree learning models can learn constituency parsing without any exposure to human-annotated tree structures. One such model is ON-LSTM (Shen et al., 2019), which is trained on language modelling and has near-state-of-the-art…

Computation and Language · Computer Science 2020-10-13 Yian Zhang

Latent tree learning models represent sentences by composing their words according to an induced parse tree, all based on a downstream task. These models often outperform baselines which use (externally provided) syntax trees to drive the…

Computation and Language · Computer Science 2020-01-16 Jean Maillard , Stephen Clark

Recursive neural networks (RvNN) have been shown useful for learning sentence representations and helped achieve competitive performance on several natural language inference tasks. However, recent RvNN-based models fail to learn simple…

Computation and Language · Computer Science 2021-04-13 Atul Sahay , Ayush Maheshwari , Ritesh Kumar , Ganesh Ramakrishnan , Manjesh Kumar Hanawal , Kavi Arya

We introduce a neural network that represents sentences by composing their words according to induced binary parse trees. We use Tree-LSTM as our composition function, applied along a tree structure found by a fully differentiable natural…

Computation and Language · Computer Science 2020-01-16 Jean Maillard , Stephen Clark , Dani Yogatama

The task of linearization is to find a grammatical order given a set of words. Traditional models use statistical methods. Syntactic linearization systems, which generate a sentence along with its syntactic tree, have shown state-of-the-art…

Computation and Language · Computer Science 2018-10-24 Linfeng Song , Yue Zhang , Daniel Gildea

In this paper we introduce Latent Tree Language Model (LTLM), a novel approach to language modeling that encodes syntax and semantics of a given sentence as a tree of word roles. The learning phase iteratively updates the trees by moving…

Computation and Language · Computer Science 2016-09-06 Tomas Brychcin

We use reinforcement learning to learn tree-structured neural networks for computing representations of natural language sentences. In contrast with prior work on tree-structured models in which the trees are either provided as input or…

Computation and Language · Computer Science 2016-11-29 Dani Yogatama , Phil Blunsom , Chris Dyer , Edward Grefenstette , Wang Ling

Latent tree learning(LTL) methods learn to parse sentences using only indirect supervision from a downstream task. Recent advances in latent tree learning have made it possible to recover moderately high quality tree structures by training…

Computation and Language · Computer Science 2019-09-24 Phu Mon Htut , Kyunghyun Cho , Samuel R. Bowman

Tree-structured neural networks encode a particular tree geometry for a sentence in the network design. However, these models have at best only slightly outperformed simpler sequence-based models. We hypothesize that neural sequence models…

Computation and Language · Computer Science 2015-11-10 Samuel R. Bowman , Christopher D. Manning , Christopher Potts

Building models that take advantage of the hierarchical structure of language without a priori annotation is a longstanding goal in natural language processing. We introduce such a model for the task of machine translation, pairing a…

Computation and Language · Computer Science 2017-09-07 James Bradbury , Richard Socher

We propose a neural language model capable of unsupervised syntactic structure induction. The model leverages the structure information to form better semantic representations and better language modeling. Standard recurrent neural networks…

Computation and Language · Computer Science 2018-02-20 Yikang Shen , Zhouhan Lin , Chin-Wei Huang , Aaron Courville

Different from other sequential data, sentences in natural language are structured by linguistic grammars. Previous generative conversational models with chain-structured decoder ignore this structure in human language and might generate…

Artificial Intelligence · Computer Science 2018-01-04 Ganbin Zhou , Ping Luo , Rongyu Cao , Yijun Xiao , Fen Lin , Bo Chen , Qing He

While sentence simplification is an active research topic in NLP, its adjacent tasks of sentence complexification and same-level paraphrasing are not. To train models on all three tasks, we present two new unsupervised datasets. We compare…

Computation and Language · Computer Science 2023-11-22 Alison Chi , Li-Kuang Chen , Yi-Chen Chang , Shu-Hui Lee , Jason S. Chang

Modern large-scale Pre-trained Language Models (PLMs) have achieved tremendous success on a wide range of downstream tasks. However, most of the LM pre-training objectives only focus on text reconstruction, but have not sought to learn…

Computation and Language · Computer Science 2022-10-28 Liliang Ren , Zixuan Zhang , Han Wang , Clare R. Voss , Chengxiang Zhai , Heng Ji

Tree-structured recursive neural networks (TreeRNNs) for sentence meaning have been successful for many applications, but it remains an open question whether the fixed-length representations that they learn can support tasks as demanding as…

Computation and Language · Computer Science 2015-05-15 Samuel R. Bowman , Christopher Potts , Christopher D. Manning

Many state-of-art neural models designed for monotonicity reasoning perform poorly on downward inference. To address this shortcoming, we developed an attentive tree-structured neural network. It consists of a tree-based…

Computation and Language · Computer Science 2021-01-05 Zeming Chen

Discourse structure is integral to understanding a text and is helpful in many NLP tasks. Learning latent representations of discourse is an attractive alternative to acquiring expensive labeled discourse data. Liu and Lapata (2018) propose…

Computation and Language · Computer Science 2019-06-11 Elisa Ferracane , Greg Durrett , Junyi Jessy Li , Katrin Erk

Syntactic Language Models (SLMs) can be trained efficiently to reach relatively high performance; however, they have trouble with inference efficiency due to the explicit generation of syntactic structures. In this paper, we propose a new…

Computation and Language · Computer Science 2025-08-20 Ryo Yoshida , Taiga Someya , Yohei Oseki

Decision trees are well-known due to their ease of interpretability. To improve accuracy, we need to grow deep trees or ensembles of trees. These are hard to interpret, offsetting their original benefits. Shapley values have recently become…

Machine Learning · Computer Science 2023-01-26 Peng Yu , Chao Xu , Albert Bifet , Jesse Read
‹ Prev 1 2 3 10 Next ›