English
Related papers

Related papers: Tetra-Tagging: Word-Synchronous Parsing with Linea…

200 papers

In constituency parsing, span-based decoding is an important direction. However, for Chinese sentences, because of their linguistic characteristics, it is necessary to utilize other models to perform word segmentation first, which…

Computation and Language · Computer Science 2022-12-01 Zhicheng Wang , Tianyu Shi , Cong Liu

We present a deep hierarchical recurrent neural network for sequence tagging. Given a sequence of words, our model employs deep gated recurrent units on both character and word levels to encode morphology and context information, and…

Computation and Language · Computer Science 2016-08-10 Zhilin Yang , Ruslan Salakhutdinov , William Cohen

We propose a method for unsupervised parsing based on the linguistic notion of a constituency test. One type of constituency test involves modifying the sentence via some transformation (e.g. replacing the span with a pronoun) and then…

Computation and Language · Computer Science 2020-10-08 Steven Cao , Nikita Kitaev , Dan Klein

The hashtag recommendation problem addresses recommending (suggesting) one or more hashtags to explicitly tag a post made on a given social network platform, based upon the content and context of the post. In this work, we propose a novel…

Computation and Language · Computer Science 2017-12-06 Kuntal Dey , Ritvik Shrivastava , Saroj Kaushik , L. Venkata Subramaniam

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

The task of incomplete utterance rewriting has recently gotten much attention. Previous models struggled to extract information from the dialogue context, as evidenced by the low restoration scores. To address this issue, we propose a novel…

Machine Learning · Computer Science 2023-07-14 Yunshan Chen

This paper presents a tree-to-tree transduction method for sentence compression. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of the tree topology and can thus naturally capture…

Computation and Language · Computer Science 2014-01-23 Trevor Anthony Cohn , Mirella Lapata

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

Recent analyses suggest that encoders pretrained for language modeling capture certain morpho-syntactic structure. However, probing frameworks for word vectors still do not report results on standard setups such as constituent and…

Computation and Language · Computer Science 2020-02-06 David Vilares , Michalina Strzyz , Anders Søgaard , Carlos Gómez-Rodríguez

Trigrams'n'Tags (TnT) is an efficient statistical part-of-speech tagger. Contrary to claims found elsewhere in the literature, we argue that a tagger based on Markov models performs at least as well as other current approaches, including…

Computation and Language · Computer Science 2007-05-23 Thorsten Brants

Sentence-level classification and sequential labeling are two fundamental tasks in language understanding. While these two tasks are usually modeled separately, in reality, they are often correlated, for example in intent classification and…

Computation and Language · Computer Science 2017-10-02 Mingbo Ma , Kai Zhao , Liang Huang , Bing Xiang , Bowen Zhou

We propose a novel and simple method for semi-supervised text classification. The method stems from the hypothesis that a classifier with pretrained word embeddings always outperforms the same classifier with randomly initialized word…

Computation and Language · Computer Science 2019-10-01 Hwiyeol Jo , Ceyda Cinarel

Combinatory Category Grammar (CCG) supertagging is a task to assign lexical categories to each word in a sentence. Almost all previous methods use fixed context window sizes as input features. However, it is obvious that different tags…

Computation and Language · Computer Science 2016-10-11 Huijia Wu , Jiajun Zhang , Chengqing Zong

Recently, span-based constituency parsing has achieved competitive accuracies with extremely simple models by using bidirectional RNNs to model "spans". However, the minimal span parser of Stern et al (2017a) which holds the current state…

Computation and Language · Computer Science 2018-05-23 Juneki Hong , Liang Huang

We discuss combining knowledge-based (or rule-based) and statistical part-of-speech taggers. We use two mature taggers, ENGCG and Xerox Tagger, to independently tag the same text and combine the results to produce a fully disambiguated…

cmp-lg · Computer Science 2008-02-03 Pasi Tapanainen , Atro Voutilainen

Semantic parsing is the problem of deriving machine interpretable meaning representations from natural language utterances. Neural models with encoder-decoder architectures have recently achieved substantial improvements over traditional…

Computation and Language · Computer Science 2019-09-30 Huseyin A. Inan , Gaurav Singh Tomar , Huapu Pan

Word segmentation and part-of-speech tagging are two critical preliminary steps for downstream tasks in Vietnamese natural language processing. In reality, people tend to consider also the phrase boundary when performing word segmentation…

Computation and Language · Computer Science 2021-06-17 Duc-Vu Nguyen , Kiet Van Nguyen , Ngan Luu-Thuy Nguyen

In this paper, we propose a novel BTG-forest-based alignment method. Based on a fast unsupervised initialization of parameters using variational IBM models, we synchronously parse parallel sentences top-down and align hierarchically under…

Computation and Language · Computer Science 2017-11-21 Hao Wang , Yves Lepage

Tasks that model the relation between pairs of tokens in a string are a vital part of understanding natural language. Such tasks, in general, require exhaustive pair-wise comparisons of tokens, thus having a quadratic runtime complexity in…

Computation and Language · Computer Science 2023-12-13 Tianyu Liu , Afra Amini , Mrinmaya Sachan , Ryan Cotterell

Word embeddings are effective intermediate representations for capturing semantic regularities between words, when learning the representations of text sequences. We propose to view text classification as a label-word joint embedding…

Computation and Language · Computer Science 2018-05-14 Guoyin Wang , Chunyuan Li , Wenlin Wang , Yizhe Zhang , Dinghan Shen , Xinyuan Zhang , Ricardo Henao , Lawrence Carin