English
Related papers

Related papers: Improving Semantic Composition with Offset Inferen…

200 papers

The quadratic complexity of self-attention constrains Large Language Models (LLMs) in processing long contexts, a capability essential for many advanced applications. Context compression aims to alleviate this computational bottleneck while…

Computation and Language · Computer Science 2025-12-05 Yangning Li , Shaoshen Chen , Yinghui Li , Yankai Chen , Hai-Tao Zheng , Hui Wang , Wenhao Jiang , Philip S. Yu

Natural language is characterized by compositionality: the meaning of a complex expression is constructed from the meanings of its constituent parts. To facilitate the evaluation of the compositional abilities of language processing…

Computation and Language · Computer Science 2020-10-13 Najoung Kim , Tal Linzen

Transformer architectures have achieved remarkable success across language, vision, and multimodal tasks, and there is growing demand for them to address in-context compositional learning tasks. In these tasks, models solve the target…

Machine Learning · Computer Science 2025-11-26 Wei Chen , Jingxi Yu , Zichen Miao , Qiang Qiu

Decision trees are important both as interpretable models amenable to high-stakes decision-making, and as building blocks of ensemble methods such as random forests and gradient boosting. Their statistical properties, however, are not well…

Machine Learning · Statistics 2021-10-20 Yan Shuo Tan , Abhineet Agarwal , Bin Yu

Selecting input features of top relevance has become a popular method for building self-explaining models. In this work, we extend this selective rationalization approach to text matching, where the goal is to jointly select and align text…

Machine Learning · Computer Science 2020-05-28 Kyle Swanson , Lili Yu , Tao Lei

Current approaches in paraphrase generation and detection heavily rely on a single general similarity score, ignoring the intricate linguistic properties of language. This paper introduces two new tasks to address this shortcoming by…

Computation and Language · Computer Science 2024-07-17 Jan Philip Wahle , Bela Gipp , Terry Ruas

Embodied AI has made significant progress acting in unexplored environments. However, tasks such as object search have largely focused on efficient policy learning. In this work, we identify several gaps in current search methods: They…

Despite the success of sequence-to-sequence (seq2seq) models in semantic parsing, recent work has shown that they fail in compositional generalization, i.e., the ability to generalize to new structures built of components observed during…

Computation and Language · Computer Science 2021-06-15 Jonathan Herzig , Jonathan Berant

The detection of allusive text reuse is particularly challenging due to the sparse evidence on which allusive references rely---commonly based on none or very few shared words. Arguably, lexical semantics can be resorted to since uncovering…

Computation and Language · Computer Science 2019-05-09 Enrique Manjavacas , Brian Long , Mike Kestemont

Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is prohibitively expensive. This work aims to improve the…

Computation and Language · Computer Science 2007-05-23 Rebecca Hwa

Levering data on social media, such as Twitter and Facebook, requires information retrieval algorithms to become able to relate very short text fragments to each other. Traditional text similarity methods such as tf-idf cosine-similarity,…

Information Retrieval · Computer Science 2015-12-03 Cedric De Boom , Steven Van Canneyt , Steven Bohez , Thomas Demeester , Bart Dhoedt

We propose a novel dependency-based hybrid tree model for semantic parsing, which converts natural language utterance into machine interpretable meaning representations. Unlike previous state-of-the-art models, the semantic information is…

Computation and Language · Computer Science 2018-09-05 Zhanming Jie , Wei Lu

Structured language models for speech recognition have been shown to remedy the weaknesses of n-gram models. All current structured language models are, however, limited in that they do not take into account dependencies between…

Computation and Language · Computer Science 2007-05-23 Rens Bod

One of the roadblocks to a better understanding of neural networks' internals is \textit{polysemanticity}, where neurons appear to activate in multiple, semantically distinct contexts. Polysemanticity prevents us from identifying concise,…

Machine Learning · Computer Science 2023-10-05 Hoagy Cunningham , Aidan Ewart , Logan Riggs , Robert Huben , Lee Sharkey

Sampling is a common strategy for generating text from probabilistic models, yet standard ancestral sampling often results in text that is incoherent or ungrammatical. To alleviate this issue, various modifications to a model's sampling…

Computation and Language · Computer Science 2024-01-08 Clara Meister , Tiago Pimentel , Luca Malagutti , Ethan G. Wilcox , Ryan Cotterell

Probabilistic word embeddings have shown effectiveness in capturing notions of generality and entailment, but there is very little work on doing the analogous type of investigation for sentences. In this paper we define probabilistic models…

Computation and Language · Computer Science 2020-05-19 Mingda Chen , Kevin Gimpel

Standard language models employ unique, monolithic embeddings for each token, potentially limiting their ability to capture the multifaceted nature of word meanings. We investigate whether tokens can be more effectively represented through…

Computation and Language · Computer Science 2025-09-24 Kavin R , Pawan Goyal

There have been several efforts to extend distributional semantics beyond individual words, to measure the similarity of word pairs, phrases, and sentences (briefly, tuples; ordered sets of words, contiguous or noncontiguous). One way to…

Machine Learning · Computer Science 2013-10-21 Peter D. Turney

In tasks like semantic parsing, instruction following, and question answering, standard deep networks fail to generalize compositionally from small datasets. Many existing approaches overcome this limitation with model architectures that…

Computation and Language · Computer Science 2023-07-06 Ekin Akyürek , Jacob Andreas

Much like sentences are composed of words, words themselves are composed of smaller units. For example, the English word questionably can be analyzed as question+able+ly. However, this structural decomposition of the word does not directly…

Computation and Language · Computer Science 2018-11-13 Ryan Cotterell , Hinrich Schütze