arXiv:2607. 20483v1 Announce Type: new Abstract: Constraining the generation of autoregressive large language models (LLMs) is an important component of integrating language models into formal systems.
arXiv:2302.00129v2 Announce Type: replace Abstract: Despite their widespread use, the principles governing the organisation of syntactic dependency trees remain poorly understood. I analyse dependenc...
The paper introduces a framework called stochastic lexical calculus that determines when probabilities produced by large language models can be used to represent sequential states in scientific systems. It defines typed measurable transformations of contextual language, constructs a minimal closed representation, and provides necessary and sufficient conditions for unique semantic updates. The authors prove bounds on irreducible nonclosure and accumulated error, and show that under average contraction an external random recursion on a probability simplex is stable and unique. Empirical tests on frozen experiments demonstrate that raw prompt-conditioned probabilities fail an invariance gate, but after prompt-specific calibration a common three-state representation satisfies stability gates and covers 28 of 30 eight-step paths, achieving 0.933 coverage at a nominal 0.90 level.
arXiv:2607. 18961v1 Announce Type: new Abstract: Large language models (LLMs) generate fluent text by incrementally predicting the next token from a prefix.
arXiv:2609.16854v1 Announce Type: new Abstract: Probability is fundamental to theories of language comprehension, production, acquisition, and evolution, as well as to large language models. Existing...
arXiv:2606. 23715v1 Announce Type: cross Abstract: A Markov Logic Network (MLN) is a probabilistic relational model used in Statistical Relational Artificial Intelligence for defining a probability distribution on the set of possible worlds with domain $D$ for an arbitrary finite domain $D$.
arXiv:2608. 18813v1 Announce Type: cross Abstract: In the last years, a number of proofs of the fact that $O_2$ is a multiple context-free grammar (MCFG) were given.
TatBLiMP is the first benchmark of linguistic minimal pairs for the Tatar language, covering 16 morphosyntactic phenomena across 1,248 sentence pairs that differ by a single morpheme. Each pair contains one grammatical and one ungrammatical sentence, with the ungrammatical version generated by a deterministic perturbation and ratified by a native speaker. The benchmark evaluates models by comparing their assigned probabilities, allowing assessment without text generation or parsing, and tracks performance across from-scratch, cross‑lingual, and multilingual large language models.
arXiv:2605. 11644v2 Announce Type: replace-cross Abstract: We study positive-data learning of languages admitting reduced working binary linear nondeleting multiple context-free grammar presentations of bounded fan-out.
We propose a novel framework for computing rigorous bounds on the probability that a large language model (LLM) generates harmful output to a given prompt. We study a new application of the Clopper-Pearson confidence intervals to obtain probably approximately correct (PAC) bounds for this problem.
arXiv:2406. 05335v3 Announce Type: replace-cross Abstract: Generation of text and speech in natural languages can be modeled as a stochastic process.
arXiv:2607. 20286v1 Announce Type: cross Abstract: We propose a novel framework for computing rigorous bounds on the probability that a large language model (LLM) generates harmful output to a given prompt.