English
Related papers

Related papers: Technical notes: Syntax-aware Representation Learn…

200 papers

Systematically discovering semantic relationships in text is an important and extensively studied area in Natural Language Processing, with various tasks such as entailment, semantic similarity, etc. Decomposability of sentence-level scores…

Computation and Language · Computer Science 2020-07-16 Subhadeep Maji , Rohan Kumar , Manish Bansal , Kalyani Roy , Pawan Goyal

Is the output softmax layer, which is adopted by most language models (LMs), always the best way to compute the next word probability? Given so many attention layers in a modern transformer-based LM, are the pointer networks redundant…

Computation and Language · Computer Science 2023-05-23 Haw-Shiuan Chang , Zonghai Yao , Alolika Gon , Hong Yu , Andrew McCallum

Syntactic dependency parsing is an important task in natural language processing. Unsupervised dependency parsing aims to learn a dependency parser from sentences that have no annotation of their correct parse trees. Despite its difficulty,…

Computation and Language · Computer Science 2020-10-06 Wenjuan Han , Yong Jiang , Hwee Tou Ng , Kewei Tu

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

Much recent work suggests that incorporating syntax information from dependency trees can improve task-specific transformer models. However, the effect of incorporating dependency tree information into pre-trained transformer models (e.g.,…

Computation and Language · Computer Science 2021-01-28 Devendra Singh Sachan , Yuhao Zhang , Peng Qi , William Hamilton

We recast dependency parsing as a sequence labeling problem, exploring several encodings of dependency trees as labels. While dependency parsing by means of sequence labeling had been attempted in existing work, results suggested that the…

Computation and Language · Computer Science 2019-04-01 Michalina Strzyz , David Vilares , Carlos Gómez-Rodríguez

We develop novel first- and second-order features for dependency parsing based on the Google Syntactic Ngrams corpus, a collection of subtree counts of parsed sentences from scanned books. We also extend previous work on surface $n$-gram…

Computation and Language · Computer Science 2015-02-26 Dominick Ng , Mohit Bansal , James R. Curran

Aspect-based Sentiment Analysis (ABSA), aiming at predicting the polarities for aspects, is a fine-grained task in the field of sentiment analysis. Previous work showed syntactic information, e.g. dependency trees, can effectively improve…

Computation and Language · Computer Science 2021-04-13 Junqi Dai , Hang Yan , Tianxiang Sun , Pengfei Liu , Xipeng Qiu

Aspect term extraction is one of the important subtasks in aspect-based sentiment analysis. Previous studies have shown that using dependency tree structure representation is promising for this task. However, most dependency tree structures…

Computation and Language · Computer Science 2019-05-07 Huaishao Luo , Tianrui Li , Bing Liu , Bin Wang , Herwig Unger

We consider learning a probabilistic classifier from partially-labelled supervision (inputs denoted with multiple possibilities) using standard neural architectures with a softmax as the final layer. We identify a bias phenomenon that can…

Machine Learning · Computer Science 2023-07-04 Zsolt Zombori , Agapi Rissaki , Kristóf Szabó , Wolfgang Gatterbauer , Michael Benedikt

Since the popularization of BiLSTMs and Transformer-based bidirectional encoders, state-of-the-art syntactic parsers have lacked incrementality, requiring access to the whole sentence and deviating from human language processing. This paper…

Computation and Language · Computer Science 2023-09-29 Ana Ezquerro , Carlos Gómez-Rodríguez , David Vilares

Large language models rely on attention mechanisms with a softmax activation. Yet the dominance of softmax over alternatives (e.g., component-wise or linear) remains poorly understood, and many theoretical works have focused on the…

Machine Learning · Computer Science 2026-02-27 O. Duranthon , P. Marion , C. Boyer , B. Loureiro , L. Zdeborová

LSTM language models have been shown to capture syntax-sensitive grammatical dependencies such as subject-verb agreement with a high degree of accuracy (Linzen et al., 2016, inter alia). However, questions remain regarding whether they do…

Computation and Language · Computer Science 2020-05-04 Yiding Hao

This paper describes the ICS PAS system which took part in CoNLL 2018 shared task on Multilingual Parsing from Raw Text to Universal Dependencies. The system consists of jointly trained tagger, lemmatizer, and dependency parser which are…

Computation and Language · Computer Science 2020-04-28 Piotr Rybak , Alina Wróblewska

Semantic role labeling (SRL), also known as shallow semantic parsing, is an important yet challenging task in NLP. Motivated by the close correlation between syntactic and semantic structures, traditional discrete-feature-based SRL…

Computation and Language · Computer Science 2019-07-23 Qingrong Xia , Zhenghua Li , Min Zhang , Meishan Zhang , Guohong Fu , Rui Wang , Luo Si

Large language model (LLM) agents are increasingly tasked with complex real-world analysis (e.g., in financial forecasting, scientific discovery), yet their reasoning suffers from stochastic instability and lacks a verifiable, compositional…

Artificial Intelligence · Computer Science 2026-04-28 Junyan Cheng , Kyle Richardson , Peter Chin

Machine comprehension of text is an important problem in natural language processing. A recently released dataset, the Stanford Question Answering Dataset (SQuAD), offers a large number of real questions and their answers created by humans…

Computation and Language · Computer Science 2016-11-08 Shuohang Wang , Jing Jiang

In sequence learning tasks such as language modelling, Recurrent Neural Networks must learn relationships between input features separated by time. State of the art models such as LSTM and Transformer are trained by backpropagation of…

Machine Learning · Computer Science 2019-12-04 Jeremy Gordon , David Rawlinson , Subutai Ahmad

The success of long short-term memory (LSTM) neural networks in language processing is typically attributed to their ability to capture long-distance statistical regularities. Linguistic regularities are often sensitive to syntactic…

Computation and Language · Computer Science 2016-11-07 Tal Linzen , Emmanuel Dupoux , Yoav Goldberg

Because of their superior ability to preserve sequence information over time, Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have obtained strong results on a variety of…

Computation and Language · Computer Science 2015-06-02 Kai Sheng Tai , Richard Socher , Christopher D. Manning