English
Related papers

Related papers: Learning Constituent Headedness

200 papers

Most previous work on grammar induction focuses on learning phrasal or dependency structure purely from text. However, because the signal provided by text alone is limited, recently introduced visually grounded syntax models make use of…

Computation and Language · Computer Science 2021-09-22 Ruisi Su , Shruti Rijhwani , Hao Zhu , Junxian He , Xinyu Wang , Yonatan Bisk , Graham Neubig

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

One of the most complex syntactic representations used in computational linguistics and NLP are discontinuous constituent trees, crucial for representing all grammatical phenomena of languages such as German. Recent advances in dependency…

Computation and Language · Computer Science 2020-02-06 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

The ability of deep networks to learn superior representations hinges on leveraging the proper inductive biases, considering the inherent properties of datasets. In tabular domains, it is critical to effectively handle heterogeneous…

Machine Learning · Computer Science 2024-05-15 Kyungeun Lee , Ye Seul Sim , Hye-Seung Cho , Moonjung Eo , Suhee Yoon , Sanghyu Yoon , Woohyung Lim

This paper presents a novel method that allows a machine learning algorithm following the transformation-based learning paradigm \cite{brill95:tagging} to be applied to multiple classification tasks by training jointly and simultaneously on…

Computation and Language · Computer Science 2007-05-23 Radu Florian , Grace Ngai

Sequence tagging models for constituent parsing are faster, but less accurate than other types of parsers. In this work, we address the following weaknesses of such constituent parsers: (a) high error rates around closing brackets of long…

Computation and Language · Computer Science 2019-10-15 David Vilares , Mostafa Abdou , Anders Søgaard

Constituency parsing is a fundamental and important task for natural language understanding, where a good representation of contextual information can help this task. N-grams, which is a conventional type of feature for contextual…

Computation and Language · Computer Science 2020-10-16 Yuanhe Tian , Yan Song , Fei Xia , Tong Zhang

Sequence classification is the supervised learning task of building models that predict class labels of unseen sequences of symbols. Although accuracy is paramount, in certain scenarios interpretability is a must. Unfortunately, such…

Machine Learning · Computer Science 2020-06-26 Severin Gsponer , Luca Costabello , Chan Le Van , Sumit Pai , Christophe Gueret , Georgiana Ifrim , Freddy Lecue

This work revisits the topic of jointly parsing constituency and dependency trees, i.e., to produce compatible constituency and dependency trees simultaneously for input sentences, which is attractive considering that the two types of trees…

Computation and Language · Computer Science 2024-03-27 Yanggan Gu , Yang Hou , Zhefeng Wang , Xinyu Duan , Zhenghua Li

We show how to predict the basic word-order facts of a novel language given only a corpus of part-of-speech (POS) sequences. We predict how often direct objects follow their verbs, how often adjectives follow their nouns, and in general the…

Computation and Language · Computer Science 2017-10-12 Dingquan Wang , Jason Eisner

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

Non-local features have been exploited by syntactic parsers for capturing dependencies between sub output structures. Such features have been a key to the success of state-of-the-art statistical parsers. With the rise of deep learning,…

Computation and Language · Computer Science 2018-08-29 Zhiyang Teng , Yue Zhang

A key property of neural networks (both biological and artificial) is how they learn to represent and manipulate input information in order to solve a task. Different types of representations may be suited to different types of tasks,…

Machine Learning · Computer Science 2023-07-18 Ryan Pyle , Sebastian Musslick , Jonathan D. Cohen , Ankit B. Patel

Constituent and dependency parsing, the two classic forms of syntactic parsing, have been found to benefit from joint training and decoding under a uniform formalism, Head-driven Phrase Structure Grammar (HPSG). However, decoding this…

Computation and Language · Computer Science 2021-05-21 Zuchao Li , Junru Zhou , Hai Zhao , Kevin Parnow

Inspired by the prevalence of recurrent circuits in biological brains, we investigate the degree to which directionality is a helpful inductive bias for artificial neural networks. Taking directionality as topologically-ordered information…

Machine Learning · Computer Science 2025-07-22 Yiding Song

Expressive text encoders such as RNNs and Transformer Networks have been at the center of NLP models in recent work. Most of the effort has focused on sentence-level tasks, capturing the dependencies between words in a single sentence, or…

Computation and Language · Computer Science 2021-09-15 Manuel Widmoser , Maria Leonor Pacheco , Jean Honorio , Dan Goldwasser

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

The Transformer-based models with the multi-head self-attention mechanism are widely used in natural language processing, and provide state-of-the-art results. While the pre-trained language backbones are shown to implicitly capture certain…

Computation and Language · Computer Science 2023-12-18 Zhengyuan Liu , Nancy F. Chen

We study the problem of integrating syntactic information from constituency trees into a neural model in Frame-semantic parsing sub-tasks, namely Target Identification (TI), FrameIdentification (FI), and Semantic Role Labeling (SRL). We use…

Computation and Language · Computer Science 2020-11-30 Emanuele Bastianelli , Andrea Vanzo , Oliver Lemon
‹ Prev 1 4 5 6 7 8 10 Next ›