English
Related papers

Related papers: Toric grammars: a new statistical approach to natu…

200 papers

We present a setup for training, evaluating and interpreting neural language models, that uses artificial, language-like data. The data is generated using a massive probabilistic grammar (based on state-split PCFGs), that is itself derived…

Computation and Language · Computer Science 2023-10-24 Jaap Jumelet , Willem Zuidema

A perspective of statistical language models which emphasizes their collocational aspect is advocated. It is suggested that strings be generalized in terms of classes of relationships instead of classes of objects. The single most important…

cmp-lg · Computer Science 2008-02-03 Robert John Freeman

Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…

Statistics Theory · Mathematics 2009-11-13 Christopher C. Strelioff , James P. Crutchfield , Alfred W. Hubler

A fundamental challenge in the cognitive sciences is discovering the dynamics that govern behaviour. Take the example of spoken language, which is characterised by a highly variable and complex set of physical movements that map onto the…

Computation and Language · Computer Science 2025-05-06 Sam Kirkham

We consider a Markov chain that iteratively generates a sequence of random finite words in such a way that the $n^{\mathrm{th}}$ word is uniformly distributed over the set of words of length $2n$ in which $n$ letters are $a$ and $n$ letters…

Probability · Mathematics 2016-12-23 Hye Soo Choi , Steven N. Evans

We improve the informativeness of models for conditional text generation using techniques from computational pragmatics. These techniques formulate language production as a game between speakers and listeners, in which a speaker should…

Computation and Language · Computer Science 2019-04-05 Sheng Shen , Daniel Fried , Jacob Andreas , Dan Klein

We study irreducible time-homogenous Markov chains with finite state space in discrete time. We obtain results on the sensitivity of the stationary distribution and other statistical quantities with respect to perturbations of the…

Probability · Mathematics 2007-05-23 Eilon Solan , Nicolas Vieille

The relationship between communicated language and intended meaning is often probabilistic and sensitive to context. Numerous strategies attempt to estimate such a mapping, often leveraging recursive Bayesian models of communication. In…

Computation and Language · Computer Science 2023-05-03 Benjamin Lipkin , Lionel Wong , Gabriel Grand , Joshua B Tenenbaum

Syntactic structures used to play a vital role in natural language processing (NLP), but since the deep learning revolution, NLP has been gradually dominated by neural models that do not consider syntactic structures in their design. One…

Computation and Language · Computer Science 2023-11-28 Haoyi Wu , Kewei Tu

Increasing availability and quality of actual, as opposed to scheduled, open transport data offers new possibilities for capturing the spatiotemporal dynamics of the railway and other networks of social infrastructure. One way to describe…

Social and Information Networks · Computer Science 2020-12-11 Georg Anagnostopoulos , Vahid Moosavi

Language models for speech recognition typically use a probability model of the form Pr(a_n | a_1, a_2, ..., a_{n-1}). Stochastic grammars, on the other hand, are typically used to assign structure to utterances. A language model of the…

Computation and Language · Computer Science 2007-05-23 Mark-Jan Nederhof , Anoop Sarkar , Giorgio Satta

Statistical topic models provide a general data-driven framework for automated discovery of high-level knowledge from large collections of text documents. While topic models can potentially discover a broad range of themes in a data set,…

Artificial Intelligence · Computer Science 2008-08-08 Chaitanya Chemudugunta , Padhraic Smyth , Mark Steyvers

Understanding why certain individuals work well (or poorly) together as a team is a key research focus in the psychological and behavioral sciences and a fundamental problem for team-based organizations. Nevertheless, we have a limited…

Social and Information Networks · Computer Science 2023-01-11 Lisa O'Bryan , Santiago Segarra , Jensine Paoletti , Stephanie Zajac , Margaret E. Beier , Ashutosh Sabharwal , Matthew Wettergreen , Eduardo Salas

Recently there has been significant activity in developing algorithms with provable guarantees for topic modeling. In standard topic models, a topic (such as sports, business, or politics) is viewed as a probability distribution $\vec a_i$…

Machine Learning · Computer Science 2016-11-07 Avrim Blum , Nika Haghtalab

Generating a long, coherent text such as a paragraph requires a high-level control of different levels of relations between sentences (e.g., tense, coreference). We call such a logical connection between sentences as a (paragraph) flow. In…

Computation and Language · Computer Science 2019-09-02 Dongyeop Kang , Hiroaki Hayashi , Alan W Black , Eduard Hovy

Grammaticality and likelihood are distinct notions in human language. Pretrained language models (LMs), which are probabilistic models of language fitted to maximize corpus likelihood, generate grammatically well-formed text and…

Computation and Language · Computer Science 2026-05-07 Yingshan Susan Wang , Linlu Qiu , Zhaofeng Wu , Roger P. Levy , Yoon Kim

We introduce Markov substitute processes, a new model at the crossroad of statistics and formal grammars, and prove its main property : Markov substitute processes with a given support form an exponential family.

Machine Learning · Statistics 2016-03-28 Olivier Catoni , Thomas Mainguy

Rumor and information spreading are natural processes that emerge from human-to-human interaction. Mathematically, this was explored in the popular Maki-Thompson model, where a phase transition was thought to be absent. Here, we show that a…

A statistical model for segmentation and word discovery in continuous speech is presented. An incremental unsupervised learning algorithm to infer word boundaries based on this model is described. Results of empirical tests showing that the…

Computation and Language · Computer Science 2007-05-23 Anand Venkataraman

Large Language Models achieve next-token prediction by transporting a vectorized piece of text (prompt) across an accompanying embedding space under the action of successive transformer layers. The resulting high-dimensional trajectories…

Machine Learning · Computer Science 2025-02-17 Raphaël Sarfati , Toni J. B. Liu , Nicolas Boullé , Christopher J. Earls