English
Related papers

Related papers: In-Order Transition-based Constituent Parsing

200 papers

Transition-based models can be fast and accurate for constituent parsing. Compared with chart-based models, they leverage richer features by extracting history information from a parser stack, which spans over non-local constituents. On the…

Computation and Language · Computer Science 2016-12-05 Jiangming Liu , Yue Zhang

We propose a novel in-order chart-based model for constituent parsing. Compared with previous CKY-style and top-down models, our model gains advantages from in-order traversal of a tree (rich features, lookahead information and high…

Computation and Language · Computer Science 2021-02-09 Yang Wei , Yuanbin Wu , Man Lan

We propose a technique for learning representations of parser states in transition-based dependency parsers. Our primary innovation is a new control structure for sequence-to-sequence neural networks---the stack LSTM. Like the conventional…

Computation and Language · Computer Science 2015-06-01 Chris Dyer , Miguel Ballesteros , Wang Ling , Austin Matthews , Noah A. Smith

An increasingly wide range of artificial intelligence applications rely on syntactic information to process and extract meaning from natural language text or speech, with constituent trees being one of the most widely used syntactic…

Computation and Language · Computer Science 2019-08-05 Daniel Fernández-González , Carlos Gómez-Rodríguez

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

Sequence-to-sequence constituent parsing requires a linearization to represent trees as sequences. Top-down tree linearizations, which can be based on brackets or shift-reduce actions, have achieved the best accuracy to date. In this paper,…

Computation and Language · Computer Science 2020-05-28 Daniel Fernández-González , Carlos Gómez-Rodríguez

Parsing sentences into syntax trees can benefit downstream applications in NLP. Transition-based parsers build trees by executing actions in a state transition system. They are computationally efficient, and can leverage machine learning to…

Computation and Language · Computer Science 2020-10-29 Kaiyu Yang , Jia Deng

Due to its great importance in deep natural language understanding and various down-stream applications, text-level parsing of discourse rhetorical structure (DRS) has been drawing more and more attention in recent years. However, all the…

Computation and Language · Computer Science 2021-05-20 Longyin Zhang , Yuqing Xing , Fang Kong , Peifeng Li , Guodong Zhou

Transition-based top-down parsing with pointer networks has achieved state-of-the-art results in multiple parsing tasks, while having a linear time complexity. However, the decoder of these parsers has a sequential structure, which does not…

Computation and Language · Computer Science 2022-10-21 Linlin Liu , Xiang Lin , Shafiq Joty , Simeng Han , Lidong Bing

We introduce novel dynamic oracles for training two of the most accurate known shift-reduce algorithms for constituent parsing: the top-down and in-order transition-based parsers. In both cases, the dynamic oracles manage to notably…

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

This paper examines efficient predictive broad-coverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses that are fully connected trees spanning the entire left…

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

We introduce a top-down approach to discourse parsing that is conceptually simpler than its predecessors (Kobayashi et al., 2020; Zhang et al., 2020). By framing the task as a sequence labelling problem where the goal is to iteratively…

Computation and Language · Computer Science 2021-04-07 Fajri Koto , Jey Han Lau , Timothy Baldwin

Intelligent voice assistants, such as Apple Siri and Amazon Alexa, are widely used nowadays. These task-oriented dialogue systems require a semantic parsing module in order to process user utterances and understand the action to be…

Computation and Language · Computer Science 2024-09-11 Daniel Fernández-González

Syntactic structure of a sentence text is correlated with the prosodic structure of the speech that is crucial for improving the prosody and naturalness of a text-to-speech (TTS) system. Nowadays TTS systems usually try to incorporate…

Computation and Language · Computer Science 2020-12-15 Changhe Song , Jingbei Li , Yixuan Zhou , Zhiyong Wu , Helen Meng

The need for tree structure modelling on top of sequence modelling is an open issue in neural dependency parsing. We investigate the impact of adding a tree layer on top of a sequential model by recursively composing subtree representations…

Computation and Language · Computer Science 2019-02-27 Miryam de Lhoneux , Miguel Ballesteros , Joakim Nivre

Constituency parsing and nested named entity recognition (NER) are similar tasks since they both aim to predict a collection of nested and non-crossing spans. In this work, we cast nested NER to constituency parsing and propose a novel…

Computation and Language · Computer Science 2022-03-10 Songlin Yang , Kewei Tu

The addition of syntax-aware decoding in Neural Machine Translation (NMT) systems requires an effective tree-structured neural network, a syntax-aware attention model and a language generation model that is sensitive to sentence structure.…

Computation and Language · Computer Science 2018-09-07 Jetic Gū , Hassan S. Shavarani , Anoop Sarkar

Understanding how structured sequence information can be represented and generalized in neural systems is key to modeling the transition from acoustic input to emergent structure. In this study, we propose a rank-order based neural network…

Neural and Evolutionary Computing · Computer Science 2026-03-20 Xiaodan Chen , Alexandre Pitti , Mathias Quoy , Nancy Chen

Convolutional neural networks model the transformation of the input sensory data at the bottom of a network hierarchy to the semantic information at the top of the visual hierarchy. Feedforward processing is sufficient for some object…

Computer Vision and Pattern Recognition · Computer Science 2020-02-05 Mahdi Biparva , John Tsotsos

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
‹ Prev 1 2 3 10 Next ›