English
Related papers

Related papers: CD Grammar Systems with Two Propagating Scattered …

200 papers

In this paper, we consider combining the ideas of forbidden random context grammars as well as of ordered grammars with cooperating distributed grammar systems (CDGS). We focus on investigating their generative capacities. Both ideas can be…

Formal Languages and Automata Theory · Computer Science 2026-04-23 Henning Fernau , Lakshmanan Kuppusamy , Jana Schulz

In this paper we are interested in the solution of Compressed Sensing (CS) problems where the signals to be recovered are sparse in coherent and redundant dictionaries. CS problems of this type are convex with non-smooth and non-separable…

Optimization and Control · Mathematics 2014-06-02 Ioannis Dassios , Kimon Fountoulakis , Jacek Gondzio

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

Spoken language change detection (LCD) refers to detecting language switching points in a multilingual speech signal. Speaker change detection (SCD) refers to locating the speaker change points in a multispeaker speech signal. The objective…

Audio and Speech Processing · Electrical Eng. & Systems 2023-10-10 Jagabandhu Mishra , S. R. Mahadeva Prasanna

Probabilistic context-free grammars (PCFGs), which are commonly used to generate trees randomly, have been well analyzed theoretically, leading to applications in various domains. Despite their utility, the distributions that the grammar…

Disordered Systems and Neural Networks · Physics 2024-08-30 Kai Nakaishi , Koji Hukushima

Many studies were recently done for investigating the properties of contextual language models but surprisingly, only a few of them consider the properties of these models in terms of semantic similarity. In this article, we first focus on…

Computation and Language · Computer Science 2021-11-25 Olivier Ferret

We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.

Formal Languages and Automata Theory · Computer Science 2015-03-18 Zoltan Esik

This paper presents a restricted form of linear indexed grammars, called even linear indexed grammars, which yield the even linear indexed languages. These languages properly contain the context-free languages and are contained in the set…

Formal Languages and Automata Theory · Computer Science 2014-08-26 Benjamin Caulfield

Distributional semantic models learn vector representations of words through the contexts they occur in. Although the choice of context (which often takes the form of a sliding window) has a direct influence on the resulting embeddings, the…

Computation and Language · Computer Science 2017-04-20 Pierre Lison , Andrey Kutuzov

Categorical compositional distributional semantics is an approach to modelling language that combines the success of vector-based models of meaning with the compositional power of formal semantics. However, this approach was developed…

Computation and Language · Computer Science 2024-01-17 Martha Lewis

Cross-linguistic similarities are reflected by the speech sound systems of languages all over the world. In this work we try to model such similarities observed in the consonant inventories, through a complex bipartite network. We present a…

Physics and Society · Physics 2007-05-23 Monojit Choudhury , Animesh Mukherjee , Anupam Basu , Niloy Ganguly

Diffusion models have quickly become the go-to paradigm for generative modelling of perceptual signals (such as images and sound) through iterative refinement. Their success hinges on the fact that the underlying physical phenomena are…

Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. We develop the theory of scs to reason about the distributed information of potentially infinite groups.…

Multiagent Systems · Computer Science 2021-02-09 Michell Guzmán , Sophia Knight , Santiago Quintero , Sergio Ramírez , Camilo Rueda , Frank Valencia

Lexical Semantic Change is the study of how the meaning of words evolves through time. Another related question is whether and how lexical relations over pairs of words, such as synonymy, change over time. There are currently two competing,…

Computation and Language · Computer Science 2023-05-31 Bastien Liétard , Mikaela Keller , Pascal Denis

This paper solves an open problem concerning the generative power of nonerasing context-free rewriting systems using a simple mechanism for checking for context dependencies, in the literature known as semi-conditional grammars of degree…

Formal Languages and Automata Theory · Computer Science 2010-04-22 Tomas Masopust

The separability problem for word languages of a class $\mathcal{C}$ by languages of a class $\mathcal{S}$ asks, for two given languages $I$ and $E$ from $\mathcal{C}$, whether there exists a language $S$ from $\mathcal{S}$ that includes…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Wojciech Czerwiński , Wim Martens , Lorijn van Rooijen , Marc Zeitoun , Georg Zetzsche

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

Many tasks in Natural Language Processing involve recognizing lexical entailment. Two different approaches to this problem have been proposed recently that are quite different from each other. The first is an asymmetric similarity measure…

Computation and Language · Computer Science 2014-12-03 John Wieting

Contextual influences on language often exhibit substantial cross-lingual regularities; for example, we are more verbose in situations that require finer distinctions. However, these regularities are sometimes obscured by semantic and…

Computation and Language · Computer Science 2018-05-22 Will Monroe , Jennifer Hu , Andrew Jong , Christopher Potts

Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space and time polynomial in…

Formal Languages and Automata Theory · Computer Science 2013-11-27 Pierluigi Crescenzi , Daniel Gildea , Andrea Marino , Gianluca Rossi , Giorgio Satta
‹ Prev 1 2 3 10 Next ›