Related papers: On Union-Closedness of Language Generation
Consider a compact connected Lie group $G$ and the corresponding Lie algebra $\cal L$. Let $\{X_1,...,X_m\}$ be a set of generators for the Lie algebra $\cal L$. We prove that $G$ is uniformly finitely generated by $\{X_1,...,X_m\}$. This…
In this paper, we propose a new paradigm for paraphrase generation by treating the task as unsupervised machine translation (UMT) based on the assumption that there must be pairs of sentences expressing the same meaning in a large-scale…
This note constructs a finitely generated group $W$ whose word-growth is exponential, but for which the infimum of the growth rates over all finite generating sets is 1 -- in other words, of non-uniformly exponential growth. This answers a…
In modular dialogue systems, natural language understanding (NLU) and natural language generation (NLG) are two critical components, where NLU extracts the semantics from the given texts and NLG is to construct corresponding natural…
Altenbernd, Thomas and W\"ohrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the B\"uchi and Muller ones,…
We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…
Controlled generation refers to the problem of creating text that contains stylistic or semantic attributes of interest. Many approaches reduce this problem to training a predictor of the desired attribute. For example, researchers hoping…
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…
In "On the asymptotics of the growth of 2-step nilpotent groups" (J. London Math. Soc. (2), 58 (1998)), we remarked that, contrary to 2-step nilpotent simply connected Lie groups, in 3-step nilpotent simply connected Lie groups it is…
Training large-scale generative models is resource-intensive and relies heavily on heuristic dataset weighting. We address two fundamental questions: Can we train Large Language Models (LLMs) modularly-combining small, domain-specific…
Constraint-based grammars can, in principle, serve as the major linguistic knowledge source for both parsing and generation. Surface generation starts from input semantics representations that may vary across grammars. For many declarative…
This work is concerned with a relationship regarding the closedness of the singular locus of a Noetherian scheme and existence of classical generators in its category of coherent sheaves, associated bounded derived category, and singularity…
Large Language Models (LLMs) have demonstrated a powerful ability for text generation. However, achieving optimal results with a given prompt or instruction can be challenging, especially for billion-sized models. Additionally, undesired…
Polynomial--time constant--space quantum Turing machines (QTMs) and logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakary\i lmaz 2014, arXiv:1411.7647). In this…
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…
Recent studies have adopted pre-trained language models, such as CodeT5 and CodeGPT, for automated program generation tasks like code generation, repair, and translation. Numerous language model-based approaches have been proposed and…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
We investigate learning collections of languages from texts by an inductive inference machine with access to the current datum and a bounded memory in form of states. Such a bounded memory states (BMS) learner is considered successful in…
In the antecedent paper to this it was established that there is an algebraic number $\xi\approx 2.30522$ such that while there are uncountably many growth rates of permutation classes arbitrarily close to $\xi$, there are only countably…
We present unpublished work of D.Carter, G.Keller, and E.Paige on bounded generation in special linear groups. Let n be a positive integer, and let A = O be the ring of integers of an algebraic number field K (or, more generally, let A be a…