English
Related papers

Related papers: In-Order Transition-based Constituent Parsing

200 papers

Incorporating hierarchical structures like constituency trees has been shown to be effective for various natural language processing (NLP) tasks. However, it is evident that state-of-the-art (SOTA) sequence-based models like the Transformer…

Machine Learning · Computer Science 2020-02-20 Xuan-Phi Nguyen , Shafiq Joty , Steven C. H. Hoi , Richard Socher

Syntax has been shown to benefit Coreference Resolution from incorporating long-range dependencies and structured information captured by syntax trees, either in traditional statistical machine learning based systems or recently proposed…

Computation and Language · Computer Science 2022-02-23 Fan Jiang , Trevor Cohn

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

Text generation is a fundamental building block in natural language processing tasks. Existing sequential models performs autoregression directly over the text sequence and have difficulty generating long sentences of complex structures.…

Computation and Language · Computer Science 2018-08-16 Qipeng Guo , Xipeng Qiu , Xiangyang Xue , Zheng Zhang

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

We present extensions to a continuous-state dependency parsing method that makes it applicable to morphologically rich languages. Starting with a high-performance transition-based parser that uses long short-term memory (LSTM) recurrent…

Computation and Language · Computer Science 2015-08-12 Miguel Ballesteros , Chris Dyer , Noah A. Smith

In this paper, we propose a generic model transfer scheme to make Convlutional Neural Networks (CNNs) interpretable, while maintaining their high classification accuracy. We achieve this by building a differentiable decision forest on top…

Computer Vision and Pattern Recognition · Computer Science 2021-06-08 Yilin Wang , Shaozuo Yu , Xiaokang Yang , Wei Shen

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

In Transformer-based neural machine translation (NMT), the positional encoding mechanism helps the self-attention networks to learn the source representation with order dependency, which makes the Transformer-based NMT achieve…

Computation and Language · Computer Science 2020-04-09 Kehai Chen , Rui Wang , Masao Utiyama , Eiichiro Sumita

We present a new recurrent neural network topology to enhance state-of-the-art machine learning systems by incorporating a broader context. Our approach overcomes recent limitations with extended narratives through a multi-layered…

Computation and Language · Computer Science 2018-08-07 Patrick Huber , Jan Niehues , Alex Waibel

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

We propose a transition-based bubble parser to perform coordination structure identification and dependency-based syntactic analysis simultaneously. Bubble representations were proposed in the formal linguistics literature decades ago; they…

Computation and Language · Computer Science 2021-07-16 Tianze Shi , Lillian Lee

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

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

Despite the impressive growth of the abilities of multilingual language models, such as XLM-R and mT5, it has been shown that they still face difficulties when tackling typologically-distant languages, particularly in the low-resource…

Computation and Language · Computer Science 2023-10-23 Ofir Arviv , Dmitry Nikolaev , Taelin Karidi , Omri Abend

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 propose two fast neural combinatory models for constituency parsing: binary and multi-branching. Our models decompose the bottom-up parsing process into 1) classification of tags, labels, and binary orientations or chunks and 2) vector…

Computation and Language · Computer Science 2021-06-15 Zhousi Chen , Longtu Zhang , Aizhan Imankulova , Mamoru Komachi

Prominent applications of sentiment analysis are countless, covering areas such as marketing, customer service and communication. The conventional bag-of-words approach for measuring sentiment merely counts term frequencies; however, it…

Computation and Language · Computer Science 2018-10-08 Mathias Kraus , Stefan Feuerriegel

We demonstrate that replacing an LSTM encoder with a self-attentive architecture can lead to improvements to a state-of-the-art discriminative constituency parser. The use of attention makes explicit the manner in which information is…

Computation and Language · Computer Science 2018-05-04 Nikita Kitaev , Dan Klein

The underlying structure of natural language is hierarchical; words combine into phrases, which in turn form clauses. An awareness of this hierarchical structure can aid machine learning models in performing many linguistic tasks. However,…

Machine Learning · Computer Science 2020-04-01 Ashok Thillaisundaram