English
Related papers

Related papers: Forbidden-Context & Ordered Grammar Systems

200 papers

We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages…

Formal Languages and Automata Theory · Computer Science 2022-09-01 Jürgen Dassow , Bianca Truthe

In this paper we associate permitting symbols with rules of Grammars in the components of cooperating distributed context free hexagonal array grammar systems as a control mechanism and investigating the generative power of the resulting…

Formal Languages and Automata Theory · Computer Science 2014-04-23 Sujathakumari K , Dersanambika K. S

We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Henning Fernau , Rudolf Freund , Markus Holzer

A practical tool for natural language modeling and development of human-machine interaction is developed in the context of formal grammars and languages. A new type of formal grammars, called grammars with prohibition, is introduced.…

Formal Languages and Automata Theory · Computer Science 2013-02-22 Mark Burgin

In this paper, a hierarchical context definition is added to an existing clustering algorithm in order to increase its robustness. The resulting algorithm, which clusters contexts and events separately, is used to experiment with different…

cmp-lg · Computer Science 2008-02-03 J. P. Ueberla , I. R. Gransden

In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. In the past, two independent hierarchies have been obtained for external and internal…

Computational Complexity · Computer Science 2023-09-19 Bianca Truthe

This application-oriented study concerns computational musicology, which makes use of grammar systems. We define multi-generative rule-synchronized scattered-context grammar systems (without erasing rules) and demonstrates how to…

Formal Languages and Automata Theory · Computer Science 2025-07-22 Jozef Makiš , Alexander Meduna , Zbyněk Křivka

Advancements in natural language generation (NLG) and large language models (LLMs) have led to proficient text generation in various tasks. However, integrating intricate constraints into neural text generation, due to LLMs' opacity,…

Computation and Language · Computer Science 2024-03-22 Xiang Chen , Xiaojun Wan

An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the Regular and Grammar constraints specify constraints in terms of the languages accepted by an automaton and a…

Artificial Intelligence · Computer Science 2009-03-04 George Katsirelos , Nina Narodytska , Toby Walsh

Recent advances in deep neural language models combined with the capacity of large scale datasets have accelerated the development of natural language generation systems that produce fluent and coherent texts (to various degrees of success)…

Computation and Language · Computer Science 2025-04-15 Cristina Garbacea , Qiaozhu Mei

We study the problem of multilingual automated reply suggestions (RS) model serving many languages simultaneously. Multilingual models are often challenged by model capacity and severe data distribution skew across languages. While prior…

Computation and Language · Computer Science 2021-09-16 Budhaditya Deb , Guoqing Zheng , Milad Shokouhi , Ahmed Hassan Awadallah

We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context-free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our…

Computation and Language · Computer Science 2020-03-31 Yoon Kim , Chris Dyer , Alexander M. Rush

The L(PSCG)=L(CS) problem asks whether propagating scattered context grammars and context sensitive grammars are equivalent. The presented paper reformulates and answers this problem in terms of CD grammar systems. More specifically, it…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Alexander Meduna , Jakub Martiško

Neural conversation models tend to generate safe, generic responses for most inputs. This is due to the limitations of likelihood-based decoding objectives in generation tasks with diverse outputs, such as conversation. To address this…

Computation and Language · Computer Science 2018-09-06 Ashutosh Baheti , Alan Ritter , Jiwei Li , Bill Dolan

In a real-world corpus, knowledge frequently recurs across documents but often contains inconsistencies due to ambiguous naming, outdated information, or errors, leading to complex interrelationships between contexts. Previous research has…

Computation and Language · Computer Science 2025-05-02 Hyunji Lee , Franck Dernoncourt , Trung Bui , Seunghyun Yoon

Controlling the output of Large Language Models (LLMs) through context-sensitive constraints has emerged as a promising approach to overcome the limitations of Context-Free Grammars (CFGs) in guaranteeing generation validity. However, such…

Computation and Language · Computer Science 2026-04-14 Mohammad Albinhassan , Pranava Madhyastha , Mark Law , Alessandra Russo

This paper studies constrained text generation, which is to generate sentences under certain pre-conditions. We focus on CommonGen, the task of generating text based on a set of concepts, as a representative task of constrained text…

Computation and Language · Computer Science 2021-03-15 Yixian Liu , Liwen Zhang , Wenjuan Han , Yue Zhang , Kewei Tu

Constrained clustering has gained significant attention in the field of machine learning as it can leverage prior information on a growing amount of only partially labeled data. Following recent advances in deep generative models, we…

Machine Learning · Computer Science 2022-02-02 Laura Manduchi , Kieran Chin-Cheong , Holger Michel , Sven Wellmann , Julia E. Vogt

While auxiliary information has become a key to enhancing Large Language Models (LLMs), relatively little is known about how LLMs merge these contexts, specifically contexts generated by LLMs and those retrieved from external sources. To…

Computation and Language · Computer Science 2024-06-13 Hexiang Tan , Fei Sun , Wanli Yang , Yuanzhuo Wang , Qi Cao , Xueqi Cheng

We propose a novel generative model to explore both local and global context for joint learning topics and topic-specific word embeddings. In particular, we assume that global latent topics are shared across documents, a word is generated…

Computation and Language · Computer Science 2020-08-12 Lixing Zhu , Yulan He , Deyu Zhou
‹ Prev 1 2 3 10 Next ›