English
Related papers

Related papers: A Constraint-Satisfaction Parser for Context-Free …

200 papers

The challenge of delivering efficient explanations is a critical barrier that prevents the adoption of model explanations in real-world applications. Existing approaches often depend on extensive model queries for sample-level explanations…

Machine Learning · Computer Science 2026-03-10 Deng Pan , Nuno Moniz , Nitesh Chawla

Terminology correctness is important in the downstream application of machine translation, and a prevalent way to ensure this is to inject terminology constraints into a translation system. In our submission to the WMT 2023 terminology…

Computation and Language · Computer Science 2023-10-10 Nikolay Bogoychev , Pinzhen Chen

Recent advances in generative models have made it possible to create high-quality, coherent music, with some systems delivering production-level output. Yet, most existing models focus solely on generating music from scratch, limiting their…

When the semantics of a sentence are not representable in a semantic parser's output schema, parsing will inevitably fail. Detection of these instances is commonly treated as an out-of-domain classification problem. However, there is also a…

Computation and Language · Computer Science 2018-08-28 James Ferguson , Janara Christensen , Edward Li , Edgar Gonzàlez

Transformer-based pre-trained models have gained much advance in recent years, becoming one of the most important backbones in natural language processing. Recent work shows that the attention mechanism inside Transformer may not be…

Computation and Language · Computer Science 2022-10-27 Yile Wang , Linyi Yang , Zhiyang Teng , Ming Zhou , Yue Zhang

Layout-sensitive grammars have been adopted in many modern programming languages. However, tool support for this kind of grammars still remains limited and immature. In this paper, we present Lay-it-out, an interactive framework for…

Programming Languages · Computer Science 2022-03-31 Fengmin Zhu , Jiangyi Liu , Fei He

Parsing Expression Grammars (PEGs) are a formalism that can describe all deterministic context-free languages through a set of rules that specify a top-down parser for some language. PEGs are easy to use, and there are efficient…

Formal Languages and Automata Theory · Computer Science 2014-02-17 Sérgio Medeiros , Fabio Mascarenhas , Roberto Ierusalimschy

In this paper, we present an approach to improve the accuracy of a strong transition-based dependency parser by exploiting dependency language models that are extracted from a large parsed corpus. We integrated a small number of features…

Computation and Language · Computer Science 2017-09-01 Juntao Yu , Bernd Bohnet

Large language models (LLMs) demonstrate exceptional capabilities in various scenarios. However, they suffer from much redundant information and are sensitive to the position of key information in long context scenarios. To address these…

Computation and Language · Computer Science 2025-02-11 Jiwei Tang , Jin Xu , Tingwei Lu , Zhicheng Zhang , Yiming Zhao , Lin Hai , Hai-Tao Zheng

This paper introduces a new approach to generating strongly constrained texts. We consider standardized sentence generation for the typical application of vision screening. To solve this problem, we formalize it as a discrete combinatorial…

Artificial Intelligence · Computer Science 2023-09-25 Alexandre Bonlarron , Aurélie Calabrèse , Pierre Kornprobst , Jean-Charles Régin

Ad hoc parsers are everywhere: they appear any time a string is split, looped over, interpreted, transformed, or otherwise processed. Every ad hoc parser gives rise to a language: the possibly infinite set of input strings that the program…

Software Engineering · Computer Science 2022-07-27 Michael Schröder , Jürgen Cito

Individuals' concerns about data privacy and AI safety are highly contextualized and extend beyond sensitive patterns. Addressing these issues requires reasoning about the context to identify and mitigate potential risks. Though researchers…

Computation and Language · Computer Science 2026-04-15 Haoran Li , Yulin Chen , Huihao Jing , Wenbin Hu , Tsz Ho Li , Chanhou Lou , Hong Ting Tsang , Sirui Han , Yangqiu Song

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

We propose a parser for constraint-logic grammars implementing HPSG that combines the advantages of dynamic bottom-up and advanced top-down control. The parser allows the user to apply magic compilation to specific constraints in a grammar…

Computation and Language · Computer Science 2007-05-23 Guido Minnen

Long-context large language models remain computationally expensive to run and often fail to reliably process very long inputs, which makes context compression an important component of many systems. Existing compression approaches…

Computation and Language · Computer Science 2026-04-28 Yitian Zhou , Chaoning Zhang , Jiaquan Zhang , Zhenzhen Huang , Jinyu Guo , Sung-Ho Bae , Lik-Hang Lee , Caiyan Qin , Yang Yang

Sentence matching is a fundamental task of natural language processing with various applications. Most recent approaches adopt attention-based neural models to build word- or phrase-level alignment between two sentences. However, these…

Computation and Language · Computer Science 2021-10-22 Peng Cui , Le Hu , Yuanchao Liu

Specialized lexicons are collections of words with associated constraints such as special definitions, specific roles, and intended target audiences. These constraints are necessary for content generation and documentation tasks (e.g.,…

Computation and Language · Computer Science 2024-10-07 Joseph Marvin Imperial , Harish Tayyar Madabushi

Language models have emerged as a central component across NLP, and a great deal of progress depends on the ability to cheaply adapt them (e.g., through finetuning) to new domains and tasks. A language model's vocabulary$-$typically…

Computation and Language · Computer Science 2020-10-07 Nikolaos Pappas , Phoebe Mulcaire , Noah A. Smith

Modern language models are trained almost exclusively on token sequences produced by a fixed tokenizer, an external lossless compressor often over UTF-8 byte sequences, thereby coupling the model to that compressor. This work introduces…

Computation and Language · Computer Science 2026-05-15 Lin Zheng , Xinyu Li , Qian Liu , Xiachong Feng , Lingpeng Kong

Domain experts across engineering, healthcare, and education follow strict standards for producing quality content such as technical manuals, medication instructions, and children's reading materials. However, current works in controllable…

Computation and Language · Computer Science 2024-10-07 Joseph Marvin Imperial , Gail Forey , Harish Tayyar Madabushi