English
Related papers

Related papers: Efficient Constituency Parsing by Pointing

200 papers

Topic segmentation is important in understanding scientific documents since it can not only provide better readability but also facilitate downstream tasks such as information retrieval and question answering by creating appropriate…

Computation and Language · Computer Science 2023-01-06 Jeonghwan Lee , Jiyeong Han , Sunghoon Baek , Min Song

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

Deep neural networks for machine comprehension typically utilizes only word or character embeddings without explicitly taking advantage of structured linguistic information such as constituency trees and dependency trees. In this paper, we…

Computation and Language · Computer Science 2017-09-04 Rui Liu , Junjie Hu , Wei Wei , Zi Yang , Eric Nyberg

Speculative decoding is a promising approach for accelerating large language models. The primary idea is to use a lightweight draft model to speculate the output of the target model for multiple subsequent timesteps, and then verify them in…

Computation and Language · Computer Science 2025-11-06 Yepeng Weng , Qiao Hu , Xujie Chen , Li Liu , Dianwen Mei , Huishi Qiu , Jiang Tian , Zhongchao Shi

Syntactic and semantic parsing has been investigated for decades, which is one primary topic in the natural language processing community. This article aims for a brief survey on this topic. The parsing community includes many tasks, which…

Computation and Language · Computer Science 2020-06-22 Meishan Zhang

This paper proposes a tree-based convolutional neural network (TBCNN) for discriminative sentence modeling. Our models leverage either constituency trees or dependency trees of sentences. The tree-based convolution process extracts…

Computation and Language · Computer Science 2015-06-03 Lili Mou , Hao Peng , Ge Li , Yan Xu , Lu Zhang , Zhi Jin

Treebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad coverage grammar: one can simply read the grammar off the parse trees in the treebank. While such a grammar is easy to obtain, a square-root rate of…

Computation and Language · Computer Science 2007-05-23 Alexander Krotov , Mark Hepple , Robert Gaizauskas , Yorick Wilks

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

We propose a new model for multi-token prediction in transformers, aiming to enhance sampling efficiency without compromising accuracy. Motivated by recent work that predicts the probabilities of subsequent tokens using multiple heads, we…

Machine Learning · Computer Science 2025-02-11 Artem Basharin , Andrei Chertkov , Ivan Oseledets

In this work, we use a span-based approach for Vietnamese constituency parsing. Our method follows the self-attention encoder architecture and a chart decoder using a CKY-style inference algorithm. We present analyses of the experiment…

Computation and Language · Computer Science 2020-10-21 Tuan-Vi Tran , Xuan-Thien Pham , Duc-Vu Nguyen , Kiet Van Nguyen , Ngan Luu-Thuy Nguyen

Discontinuous constituent parsers have always lagged behind continuous approaches in terms of accuracy and speed, as the presence of constituents with discontinuous yield introduces extra complexity to the task. However, a discontinuous…

Computation and Language · Computer Science 2021-09-14 Daniel Fernández-González , Carlos Gómez-Rodríguez

We introduce the task of cross-lingual semantic parsing: mapping content provided in a source language into a meaning representation based on a target language. We present: (1) a meaning representation designed to allow systems to target…

Computation and Language · Computer Science 2018-04-24 Sheng Zhang , Kevin Duh , Benjamin Van Durme

Self-training has proven to be an effective approach for cross-domain tasks, and in this study, we explore its application to cross-domain constituency parsing. Traditional self-training methods rely on limited and potentially low-quality…

Computation and Language · Computer Science 2023-11-07 Jianling Li , Meishan Zhang , Peiming Guo , Min Zhang , Yue Zhang

Deep neural networks based on layer-stacking architectures have historically suffered from poor inherent interpretability. Meanwhile, symbolic probabilistic models function with clear interpretability, but how to combine them with neural…

Computation and Language · Computer Science 2023-03-07 Xiang Hu , Xinyu Kong , Kewei Tu

Constituency parsing involves analyzing a sentence by breaking it into sub-phrases, or constituents. While many deep neural models have achieved state-of-the-art performance in this task, they often overlook the entity-violating issue,…

Computation and Language · Computer Science 2024-11-13 Xinyi Bai

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

This thesis tackles the problem of learning efficient representations of complex, structured data with a natural application to web page and element classification. We hypothesise that the context around the element inside the web page is…

Machine Learning · Computer Science 2021-11-09 Cedric Cook

Answering questions that involve multi-step reasoning requires decomposing them and using the answers of intermediate steps to reach the final answer. However, state-of-the-art models in grounded question answering often do not explicitly…

Computation and Language · Computer Science 2020-11-11 Ben Bogin , Sanjay Subramanian , Matt Gardner , Jonathan Berant

Typical vision backbones manipulate structured features. As a compromise, semantic segmentation has long been modeled as per-point prediction on dense regular grids. In this work, we present a novel and efficient modeling that starts from…

Computer Vision and Pattern Recognition · Computer Science 2022-03-29 Yifan Zhang , Bo Pang , Cewu Lu

Recent years have seen growing interest in applying neural networks and contextualized word embeddings to the parsing of historical languages. However, most advances have focused on dependency parsing, while constituency parsing for…

Computation and Language · Computer Science 2026-01-13 Yiming Liang , Fang Zhao
‹ Prev 1 4 5 6 7 8 10 Next ›