English
Related papers

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

200 papers

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

Recent progress on parse tree encoder for sentence representation learning is notable. However, these works mainly encode tree structures recursively, which is not conducive to parallelization. On the other hand, these works rarely take…

Computation and Language · Computer Science 2022-05-10 Junhua Ma , Jiajun Li , Yuxuan Liu , Shangbo Zhou , Xue Li

While vector-based language representations from pretrained language models have set a new standard for many NLP tasks, there is not yet a complete accounting of their inner workings. In particular, it is not entirely clear what aspects of…

Computation and Language · Computer Science 2021-04-16 Matteo Alleman , Jonathan Mamou , Miguel A Del Rio , Hanlin Tang , Yoon Kim , SueYeon Chung

We propose a neural-network based model for coordination boundary prediction. The network is designed to incorporate two signals: the similarity between conjuncts and the observation that replacing the whole coordination phrase with a…

Computation and Language · Computer Science 2016-10-14 Jessica Ficler , Yoav Goldberg

In this work, we develop a neural network based model which leverages dependency parsing to capture cross-positional dependencies and grammatical structures. With the help of linguistic signals, sentence-level relations can be correctly…

Computation and Language · Computer Science 2022-02-23 Congbo Ma , Wei Emma Zhang , Hu Wang , Shubham Gupta , Mingyu Guo

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

We propose a simple, scalable, fully generative model for transition-based dependency parsing with high accuracy. The model, parameterized by Hierarchical Pitman-Yor Processes, overcomes the limitations of previous generative models by…

Computation and Language · Computer Science 2015-06-30 Jan Buys , Phil Blunsom

A new language model for speech recognition inspired by linguistic analysis is presented. The model develops hidden hierarchical structure incrementally and uses it to extract meaningful information from the word history - thus enabling the…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba , Frederick Jelinek

Various models have been proposed to incorporate knowledge of syntactic structures into neural language models. However, previous works have relied heavily on elaborate components for a specific language model, usually recurrent neural…

Computation and Language · Computer Science 2022-03-22 Zhixian Yang , Xiaojun Wan

Stochastic embedding transitions introduce a probabilistic mechanism for adjusting token representations dynamically during inference, mitigating the constraints imposed through static or deterministic embeddings. A transition framework was…

Computation and Language · Computer Science 2025-08-11 Stefan Whitaker , Colin Sisate , Marcel Windsor , Nikolai Fairweather , Tarquin Goldborough , Oskar Lindenfeld

Dependency parsing is a crucial step towards deep language understanding and, therefore, widely demanded by numerous Natural Language Processing applications. In particular, left-to-right and top-down transition-based algorithms that rely…

Computation and Language · Computer Science 2022-10-27 Daniel Fernández-González , Carlos Gómez-Rodríguez

We propose a transition-based approach that, by training a single model, can efficiently parse any input sentence with both constituent and dependency trees, supporting both continuous/projective and discontinuous/non-projective syntactic…

Computation and Language · Computer Science 2022-12-26 Daniel Fernández-González , Carlos Gómez-Rodríguez

We define a mapping from transition-based parsing algorithms that read sentences from left to right to sequence labeling encodings of syntactic trees. This not only establishes a theoretical relation between transition-based parsing and…

Computation and Language · Computer Science 2020-11-03 Carlos Gómez-Rodríguez , Michalina Strzyz , David Vilares

In the training of transition-based dependency parsers, an oracle is used to predict a transition sequence for a sentence and its gold tree. However, the transition system may exhibit ambiguity, that is, there can be multiple correct…

Computation and Language · Computer Science 2018-02-07 Xuancheng Ren , Xu Sun

Transformer architectures, capable of capturing sequential dependencies in the history of user interactions, have become the dominant approach in sequential recommender systems. Despite their success, such models consider sequence elements…

Information Retrieval · Computer Science 2026-03-02 Artur Gimranov , Viacheslav Yusupov , Elfat Sabitov , Tatyana Matveeva , Anton Lysenko , Ruslan Israfilov , Evgeny Frolov

Natural language processing is a prompt research area across the country. Parsing is one of the very crucial tool in language analysis system which aims to forecast the structural relationship among the words in a given sentence. Many…

Computation and Language · Computer Science 2014-03-26 K. Sureka , K. G. Srinivasagan , S. Suganthi

Disfluency, though originating from human spoken utterances, is primarily studied as a uni-modal text-based Natural Language Processing (NLP) task. Based on early-fusion and self-attention-based multimodal interaction between text and…

Computation and Language · Computer Science 2022-11-29 Sreyan Ghosh , Utkarsh Tyagi , Sonal Kumar , Manan Suri , Rajiv Ratn Shah

Both bottom-up and top-down strategies have been used for neural transition-based constituent parsing. The parsing strategies differ in terms of the order in which they recognize productions in the derivation tree, where bottom-up…

Computation and Language · Computer Science 2017-07-18 Jiangming Liu , Yue Zhang

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 neural supervised topic segmentation models achieve distinguished superior effectiveness over unsupervised methods, with the availability of large-scale training corpora sampled from Wikipedia. These models may, however, suffer from…

Computation and Language · Computer Science 2022-09-20 Linzi Xing , Patrick Huber , Giuseppe Carenini