English
Related papers

Related papers: Pumping lemmas for linear and nonlinear context-fr…

200 papers

Previous work on cross-lingual sequence labeling tasks either requires parallel data or bridges the two languages through word-byword matching. Such requirements and assumptions are infeasible for most languages, especially for languages…

Computation and Language · Computer Science 2019-10-25 Zuyi Bao , Rui Huang , Chen Li , Kenny Q. Zhu

A growing body of work has been querying LLMs with political questions to evaluate their potential biases. However, this probing method has limited stability, making comparisons between models unreliable. In this paper, we argue that LLMs…

Computation and Language · Computer Science 2025-06-30 Patrick Haller , Jannis Vamvas , Rico Sennrich , Lena A. Jäger

Several machine learning methods aim to learn or reason about complex physical systems. A common first-step towards reasoning is to infer system parameters from observations of its behavior. In this paper, we investigate the performance of…

Computation and Language · Computer Science 2024-02-07 Sean Memery , Mirella Lapata , Kartic Subr

Unlocking the potential of Large Language Models (LLMs) in data classification represents a promising frontier in natural language processing. In this work, we evaluate the performance of different LLMs in comparison with state-of-the-art…

Computation and Language · Computer Science 2025-01-16 Arina Kostina , Marios D. Dikaiakos , Dimosthenis Stefanidis , George Pallis

Consistently scaling pre-trained language models (PLMs) imposes substantial burdens on model adaptation, necessitating more efficient alternatives to conventional fine-tuning. Given the advantage of prompting in the zero-shot setting and…

Computation and Language · Computer Science 2023-06-01 Yulin Chen , Ning Ding , Xiaobin Wang , Shengding Hu , Hai-Tao Zheng , Zhiyuan Liu , Pengjun Xie

We study the problem of deciding whether a given language is directed. A language $L$ is \emph{directed} if every pair of words in $L$ have a common (scattered) superword in $L$. Deciding directedness is a fundamental problem in connection…

Formal Languages and Automata Theory · Computer Science 2024-01-22 Moses Ganardi , Irmak Saglam , Georg Zetzsche

Emotion classification in text is a challenging task due to the processes involved when interpreting a textual description of a potential emotion stimulus. In addition, the set of emotion categories is highly domain-specific. For instance,…

Computation and Language · Computer Science 2024-03-08 Patrick Bareiß , Roman Klinger , Jeremy Barnes

It has been established in recent work that Large Language Models (LLMs) can be prompted to "self-play" conversational games that probe certain capabilities (general instruction following, strategic goal orientation, language understanding…

Computation and Language · Computer Science 2024-06-03 Anne Beyer , Kranti Chalamalasetti , Sherzod Hakimov , Brielen Madureira , Philipp Sadler , David Schlangen

Large language models (LLMs) are increasingly capable and prevalent, and can be used to produce creative content. The quality of content is influenced by the prompt used, with more specific prompts that incorporate examples generally…

Computation and Language · Computer Science 2023-08-28 Samuel Rhys Cox , Ashraf Abdul , Wei Tsang Ooi

Building causal graphs can be a laborious process. To ensure all relevant causal pathways have been captured, researchers often have to discuss with clinicians and experts while also reviewing extensive relevant medical literature. By…

Computation and Language · Computer Science 2024-02-26 Stephanie Long , Tibor Schuster , Alexandre Piché

Large language models (LLMs) represent a new paradigm for processing unstructured data, with applications across an unprecedented range of domains. In this paper, we address, through two arguments, whether the development and application of…

Methodology · Statistics 2026-02-03 Weijie Su

Large language models (LLMs) enable system builders today to create competent NLP systems through prompting, where they only need to describe the task in natural language and provide a few examples. However, in other ways, LLMs are a step…

Computation and Language · Computer Science 2023-08-24 Vijay Viswanathan , Chenyang Zhao , Amanda Bertsch , Tongshuang Wu , Graham Neubig

Instead of a monolithic programming language trying to cover all features of interest, some programming systems are designed by combining together simpler languages that cooperate to cover the same feature space. This can improve usability…

Programming Languages · Computer Science 2018-04-13 Gabriel Scherer , Max New , Nick Rioux , Amal Ahmed

Large Language Models (LLMs) have become capable of generating highly fluent text in certain languages, without modules specially designed to capture grammar or semantic coherence. What does this mean for the future of linguistic expertise…

Computation and Language · Computer Science 2025-10-17 Juri Opitz , Shira Wein , Nathan Schneider

Probing techniques for large language models (LLMs) have primarily focused on English, overlooking the vast majority of the world's languages. In this paper, we extend these probing methods to a multilingual context, investigating the…

Computation and Language · Computer Science 2025-02-03 Daoyang Li , Haiyan Zhao , Qingcheng Zeng , Mengnan Du

Prompting Large Language Models (LLMs), or providing context on the expected model of operation, is an effective way to steer the outputs of such models to satisfy human desiderata after they have been trained. But in rapidly evolving…

Machine Learning · Computer Science 2025-08-08 Younwoo Choi , Muhammad Adil Asif , Ziwen Han , John Willes , Rahul G. Krishnan

Large Language Models (LLMs) have shown useful applications in a variety of tasks, including data wrangling. In this paper, we investigate the use of an off-the-shelf LLM for schema matching. Our objective is to identify semantic…

Databases · Computer Science 2024-07-17 Marcel Parciak , Brecht Vandevoort , Frank Neven , Liesbet M. Peeters , Stijn Vansummeren

For any context-free grammar, we build a transition diagram, that is, a finite directed graph with labeled arcs, which describes the work of the grammar. This approach is new, and it is different from previously known graph models. We…

Formal Languages and Automata Theory · Computer Science 2013-05-30 Krasimir Yordzhev

Large language models (LLMs) are very proficient text generators. We leverage this capability of LLMs to generate task-specific data via zero-shot prompting and promote cross-lingual transfer for low-resource target languages. Given…

Computation and Language · Computer Science 2024-07-16 Barah Fazili , Ashish Sunil Agrawal , Preethi Jyothi

The same multi-word expressions may have different meanings in different sentences. They can be mainly divided into two categories, which are literal meaning and idiomatic meaning. Non-contextual-based methods perform poorly on this…

Computation and Language · Computer Science 2022-04-14 Zheng Chu , Ziqing Yang , Yiming Cui , Zhigang Chen , Ming Liu
‹ Prev 1 8 9 10 Next ›