English
Related papers

Related papers: Transforming Outermost into Context-Sensitive Rewr…

200 papers

Contextualized word embedding models, such as ELMo, generate meaningful representations of words and their context. These models have been shown to have a great impact on downstream applications. However, in many cases, the contextualized…

Computation and Language · Computer Science 2019-09-27 Weijia Shi , Muhao Chen , Pei Zhou , Kai-Wei Chang

Classification of crisis events, such as natural disasters, terrorist attacks and pandemics, is a crucial task to create early signals and inform relevant parties for spontaneous actions to reduce overall damage. Despite crisis such as…

Computation and Language · Computer Science 2020-05-19 Junhua Liu , Trisha Singhal , Lucienne T. M. Blessing , Kristin L. Wood , Kwan Hui Lim

Task-oriented semantic parsing is a critical component of virtual assistants, which is responsible for understanding the user's intents (set reminder, play music, etc.). Recent advances in deep learning have enabled several approaches to…

Computation and Language · Computer Science 2020-10-08 Xilun Chen , Asish Ghoshal , Yashar Mehdad , Luke Zettlemoyer , Sonal Gupta

Paraphrase generation, a.k.a. paraphrasing, is a common and important task in natural language processing. Emotional paraphrasing, which changes the emotion embodied in a piece of text while preserving its meaning, has many potential…

Computation and Language · Computer Science 2022-12-08 Justin Xie

Incremental semantic segmentation(ISS) is an emerging task where old model is updated by incrementally adding new classes. At present, methods based on convolutional neural networks are dominant in ISS. However, studies have shown that such…

Computer Vision and Pattern Recognition · Computer Science 2022-11-21 Zekai Xu , Mingyi Zhang , Jiayue Hou , Xing Gong , Chuan Wen , Chengjie Wang , Junge Zhang

Language models (LMs) have demonstrated remarkable capabilities in NLP, yet adapting them efficiently and robustly to specific tasks remains challenging. As their scale and complexity grow, fine-tuning LMs on labelled data often…

Computation and Language · Computer Science 2025-06-27 Zhengyan Shi

Dataless text classification is capable of classifying documents into previously unseen labels by assigning a score to any document paired with a label description. While promising, it crucially relies on accurate descriptions of the label…

Computation and Language · Computer Science 2020-12-09 Zewei Chu , Karl Stratos , Kevin Gimpel

Sentence embedding refers to a set of effective and versatile techniques for converting raw text into numerical vector representations that can be used in a wide range of natural language processing (NLP) applications. The majority of these…

Computation and Language · Computer Science 2021-09-08 Lele Cao , Emil Larsson , Vilhelm von Ehrenheim , Dhiana Deva Cavalcanti Rocha , Anna Martin , Sonja Horn

Extreme multi-label text classification (XMTC) is the task of finding the most relevant subset labels from an extremely large-scale label collection. Recently, some deep learning models have achieved state-of-the-art results in XMTC tasks.…

Computation and Language · Computer Science 2022-11-29 Jie Cao , Yin Zhang

Large language models (LLMs) process entire input contexts indiscriminately, which is inefficient when the information required to answer a query is localized within the context. We present dynamic context cutoff, a novel method enabling…

Computation and Language · Computer Science 2026-02-10 Roy Xie , Junlin Wang , Paul Rosu , Chunyuan Deng , Bolun Sun , Zihao Lin , Bhuwan Dhingra

Extreme multi-label text classification (XMTC) is the task of tagging each document with the relevant labels from a very large space of predefined categories. Recently, large pre-trained Transformer models have made significant performance…

Computation and Language · Computer Science 2022-04-05 Ruohong Zhang , Yau-Shian Wang , Yiming Yang , Tom Vu , Likun Lei

We develop a novel method to analyze the dynamics of stochastic rewriting systems evolving over finitary adhesive, extensive categories. Our formalism is based on the so-called rule algebra framework and exhibits an intimate relationship…

Logic in Computer Science · Computer Science 2023-06-22 Nicolas Behr , Vincent Danos , Ilias Garnier

LLMs have advanced text classification, yet existing paradigms face a trade-off: supervised (label only) fine-tuning is scalable but offers limited reasoning on complex text and lacks broader model transparency, while discrete prompt…

Computation and Language · Computer Science 2026-05-29 Tianyang Zhou , Wenbo Chen , Pierre Jinghong Liang , Leman Akoglu

Eliciting reasoning capabilities from language models (LMs) is a critical direction on the path towards building intelligent systems. Most recent studies dedicated to reasoning focus on out-of-distribution performance on…

We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni's polygraphs, a kind of rewriting systems on algebraic circuits. We translate the considered TRS into a polygraph of…

Logic in Computer Science · Computer Science 2007-05-23 Yves Guiraud

The field of Language Reasoning Models (LRMs) has been very active over the past few years with advances in training and inference techniques enabling LRMs to reason longer, and more accurately. However, a growing body of studies show that…

Computation and Language · Computer Science 2026-04-24 Yannis Belkhiter , Seshu Tirupathi , Giulio Zizzo , John D. Kelleher

Large language models (LLMs) exhibit a strong capacity for in-context learning: Given labeled examples, they can generate good predictions without parameter updates. However, many interactive settings go beyond static prediction to online…

Machine Learning · Computer Science 2026-05-12 Emile Anand , Abdullah Ateyeh , Xinyuan Cao , Max Dabagia

Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in…

Logic in Computer Science · Computer Science 2011-08-03 Andrei Dorman , Tobias Heindel

We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term…

Formal Languages and Automata Theory · Computer Science 2014-10-16 Lorenzo Clemente

Effective token compression remains a critical challenge for scaling models to handle increasingly complex and diverse datasets. A novel mechanism based on contextual reinforcement is introduced, dynamically adjusting token importance…

Computation and Language · Computer Science 2025-08-11 Naderdel Piero , Zacharias Cromwell , Nathaniel Wainwright , Matthias Nethercott
‹ Prev 1 4 5 6 7 8 10 Next ›