English
Related papers

Related papers: Difficulty Generating Factors for Context-free Lan…

200 papers

Context-free languages are widely used to describe the syntax of programming languages and natural languages. Usually, we describe a context-free language mathematically with the help of context-free grammar (for generation) or pushdown…

Formal Languages and Automata Theory · Computer Science 2020-10-13 Krasimir Yordzhev

Introductory programming courses often emphasize mastering syntax and basic constructs before progressing to more complex and interesting programs. This bottom-up approach can be frustrating for novices, shifting the focus away from problem…

Computers and Society · Computer Science 2024-10-07 Chris Kerslake , Paul Denny , David H Smith , James Prather , Juho Leinonen , Andrew Luxton-Reilly , Stephen MacNeil

Digital learning platforms enable students to learn on a flexible and individual schedule as well as providing instant feedback mechanisms. The field of STEM education requires students to solve numerous training exercises to grasp…

Computation and Language · Computer Science 2021-10-01 Stanley Uros Keller

Programming skills are typically developed through completing various hands-on exercises. Such programming problems can be contextualized to students' interests and cultural backgrounds. Prior research in educational psychology has…

Human-Computer Interaction · Computer Science 2024-07-18 Evanfiya Logacheva , Arto Hellas , James Prather , Sami Sarsa , Juho Leinonen

Natural language generation tools are powerful and effective for generating content. However, language models are known to display bias and fairness issues, making them impractical to deploy for many use cases. We here focus on how fairness…

Computation and Language · Computer Science 2024-05-03 Kevin Stowe , Benny Longwill , Alyssa Francis , Tatsuya Aoyama , Debanjan Ghosh , Swapna Somasundaran

A formal-linguistic approach for solving an entertaining task is made in this paper. The well-known task of the Hanoi towers is discussed in relation to some concepts of discrete mathematics. A context-free grammar which generate an…

Formal Languages and Automata Theory · Computer Science 2013-01-24 Krasimir Yordzhev

Reinforcement learning algorithms use correlations between policies and rewards to improve agent performance. But in dynamic or sparsely rewarding environments these correlations are often too small, or rewarding events are too infrequent…

Machine Learning · Computer Science 2020-01-23 Sebastien Racaniere , Andrew K. Lampinen , Adam Santoro , David P. Reichert , Vlad Firoiu , Timothy P. Lillicrap

A growing number of empirical software engineering researchers suggest that a complementary focus on theory is required if the discipline is to mature. A first step in theory-building involves the establishment of suitable theoretical…

Software Engineering · Computer Science 2021-02-19 Diana Kirk , Stephen G. MacDonell

Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an…

Formal Languages and Automata Theory · Computer Science 2014-08-05 Joost Engelfriet

Teaching logic effectively requires an understanding of the factors which cause logic students to struggle. Formalization exercises, which require the student to produce a formula corresponding to the natural language sentence, are a good…

Logic in Computer Science · Computer Science 2022-04-27 Alexandra Mayn , Kees van Deemter

People rely heavily on context to enrich meaning beyond what is literally said, enabling concise but effective communication. To interact successfully and naturally with people, user-facing artificial intelligence systems will require…

Computation and Language · Computer Science 2023-11-23 Daniel Fried , Nicholas Tomlin , Jennifer Hu , Roma Patel , Aida Nematzadeh

Scaling existing applications and solutions to multiple human languages has traditionally proven to be difficult, mainly due to the language-dependent nature of preprocessing and feature engineering techniques employed in traditional…

Computation and Language · Computer Science 2020-01-01 Xiaotong Liu , Yingbei Tong , Anbang Xu , Rama Akkiraju

To perform tasks specified by natural language instructions, autonomous agents need to extract semantically meaningful representations of language and map it to visual elements and actions in the environment. This problem is called…

We study the problem of grammar-constrained context-free language reachability in graphs, focusing on complexity and empirical performance. We present an algorithmic framework for evaluating reachability queries constrained by context-free…

Data Structures and Algorithms · Computer Science 2026-03-02 Faruk Alpay , Levent Sarioglu

Most learners fail to develop deep text comprehension when reading textbooks passively. Posing questions about what learners have read is a well-established way of fostering their text comprehension. However, many textbooks lack…

Computation and Language · Computer Science 2021-10-11 Tim Steuer , Anna Filighera , Tobias Meuser , Christoph Rensing

Although text-based large language models exhibit human-level writing ability and remarkable intelligence, speech language models (SLMs) still struggle to generate semantically coherent outputs. There are several potential reasons for this…

Audio and Speech Processing · Electrical Eng. & Systems 2026-01-28 Hankun Wang , Haoran Wang , Yiwei Guo , Zhihan Li , Chenpeng Du , Kai Yu

Key to tasks that require reasoning about natural language in visual contexts is grounding words and phrases to image regions. However, observing this grounding in contemporary models is complex, even if it is generally expected to take…

Computation and Language · Computer Science 2024-06-03 Noriyuki Kojima , Hadar Averbuch-Elor , Yoav Artzi

We introduce an evaluation methodology for reading comprehension tasks based on the intuition that certain examples, by the virtue of their linguistic complexity, consistently yield lower scores regardless of model size or architecture. We…

Computation and Language · Computer Science 2025-01-30 Elie Antoine , Frédéric Béchet , Géraldine Damnati , Philippe Langlais

Providing feedback on programming assignments manually is a tedious, error prone, and time-consuming task. In this paper, we motivate and address the problem of generating feedback on performance aspects in introductory programming…

Programming Languages · Computer Science 2014-09-18 Sumit Gulwani , Ivan Radiček , Florian Zuleger

This paper explores the impact of context selection on the efficiency of Large Language Models (LLMs) in generating Artificial Intelligence (AI) research leaderboards, a task defined as the extraction of (Task, Dataset, Metric, Score)…

Computation and Language · Computer Science 2024-07-03 Salomon Kabongo , Jennifer D'Souza , Sören Auer
‹ Prev 1 2 3 10 Next ›