arXiv Computation and Language
Contributions to the hierarchy of probabilistic languages
Read the original on arXiv Computation and Language →The Flow has not summarised this story yet — read it at arXiv Computation and Language.
Related stories
arXiv AI
Jul 24
Tractable Hierarchical Control of Autoregressive Language Models
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 Computation and Language
Sep 15
Universal Topological Regularity of Syntactic Structures
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...
arXiv Computation and Language
Sep 18
Foundations of Stochastic Lexical Calculus: Semantic Descent and Random Dynamics on Probability Simplices
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 AI
Jul 22
From Dependency to Compositionality: A Neurosymbolic Lifting of LLM Outputs via Combinatory Categorial Grammar
arXiv:2607. 18961v1 Announce Type: new Abstract: Large language models (LLMs) generate fluent text by incrementally predicting the next token from a prefix.
arXiv Computation and Language
Sep 16
A Data-free Universal Prior over Syntactic Structures
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 AI
Jun 24
Random coloured digraphs defined by a Markov logic network
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$.