English
Related papers

Related papers: Exact Probability Distribution versus Entropy

200 papers

Recent observations in the theory of verse and empirical metrics have suggested that constructing a verse line involves a pattern-matching search through a source text, and that the number of found elements (complete words totaling a…

cmp-lg · Computer Science 2007-05-23 Hideaki Aoyama , John Constable

Estimating the entropy of a discrete random variable is a fundamental problem in information theory and related fields. This problem has many applications in various domains, including machine learning, statistics and data compression. Over…

Information Theory · Computer Science 2020-12-22 Yuval Shalev , Amichai Painsky , Irad Ben-Gal

The dependence of the frequency distributions due to multiple meanings of words in a text is investigated by deleting letters. By coding the words with fewer letters the number of meanings per coded word increases. This increase is measured…

Computation and Language · Computer Science 2017-10-04 Xiaoyong Yan , Petter Minnhagen

We review recent progress in understanding the meaning of mutual information in natural language. Let us define words in a text as strings that occur sufficiently often. In a few previous papers, we have shown that a power-law distribution…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

This paper studies the complexity of estimating Renyi divergences of discrete distributions: $p$ observed from samples and the baseline distribution $q$ known \emph{a priori}. Extending the results of Acharya et al. (SODA'15) on estimating…

Information Theory · Computer Science 2017-02-09 Maciej Skorski

Words of estimative probability (WEP) are expressions of a statement's plausibility (probably, maybe, likely, doubt, likely, unlikely, impossible...). Multiple surveys demonstrate the agreement of human evaluators when assigning numerical…

Computation and Language · Computer Science 2023-06-27 Damien Sileo , Marie-Francine Moens

Problems of probabilistic inference and decision making under uncertainty commonly involve continuous random variables. Often these are discretized to a few points, to simplify assessments and computations. An alternative approximation is…

Artificial Intelligence · Computer Science 2013-03-08 William B. Poland , Ross D. Shachter

Given a discrete distribution, an interesting problem is to determine the minimum size of a random sample drawn from this distribution, in order to observe a given number of different records. This problem is related with many applied…

Probability · Mathematics 2012-09-21 Marco Ferrante , Nadia Frigo

Usually, probabilistic automata and probabilistic grammars have crisp symbols as inputs, which can be viewed as the formal models of computing with values. In this paper, we first introduce probabilistic automata and probabilistic grammars…

Artificial Intelligence · Computer Science 2007-05-23 Yongzhi Cao , Lirong Xia , Mingsheng Ying

Distributed language representation has become the most widely used technique for language representation in various natural language processing tasks. Most of the natural language processing models that are based on deep learning…

Computation and Language · Computer Science 2020-05-11 Martina Toshevska , Frosina Stojanovska , Jovan Kalajdjieski

The Chapter starts with introductory information about quantitative linguistics notions, like rank--frequency dependence, Zipf's law, frequency spectra, etc. Similarities in distributions of words in texts with level occupation in quantum…

Data Analysis, Statistics and Probability · Physics 2024-01-04 Andrij Rovenchak

How predictable a word is can be quantified in two ways: using human responses to the cloze task or using probabilities from language models (LMs).When used as predictors of processing effort, LM probabilities outperform probabilities…

Computation and Language · Computer Science 2026-05-27 Sathvik Nair , Byung-Doh Oh

In Probabilistic Logic Nilsson uses the device of a probability distribution over a set of possible worlds to assign probabilities to the sentences of a logical language. In his paper Nilsson concentrated on inference and associated…

Artificial Intelligence · Computer Science 2013-04-10 Fahiem Bacchus

A decision must often be made between heavy-tailed and Gaussian errors for a regression or a time series model, and the t-distribution is frequently used when it is assumed that the errors are heavy-tailed distributed. The performance of…

Computation · Statistics 2015-05-11 J. Martin van Zyl

We consider a component of the word statistics known as clump; starting from a finite set of words, clumps are maximal overlapping sets of these occurrences. This parameter has first been studied by Schbath with the aim of counting the…

Discrete Mathematics · Computer Science 2008-04-24 Frederique Bassino , Julien Clement , Julien Fayolle , Pierre Nicodeme

We introduce a method for embedding words as probability densities in a low-dimensional space. Rather than assuming that a word embedding is fixed across the entire text collection, as in standard word embedding methods, in our Bayesian…

Computation and Language · Computer Science 2018-06-12 Arthur Bražinskas , Serhii Havrylov , Ivan Titov

Word embeddings allow natural language processing systems to share statistical information across related words. These embeddings are typically based on distributional statistics, making it difficult for them to generalize to rare or unseen…

Computation and Language · Computer Science 2016-09-27 Parminder Bhatia , Robert Guthrie , Jacob Eisenstein

In research policy, effective measures that lead to improvements in the generation of knowledge must be based on reliable methods of research assessment, but for many countries and institutions this is not the case. Publication and citation…

Digital Libraries · Computer Science 2018-07-20 Alonso Rodriguez-Navarro , Ricardo Brito

We observe an infinite sequence of independent identically distributed random variables $X_1,X_2,\ldots$ drawn from an unknown distribution $p$ over $[n]$, and our goal is to estimate the entropy $H(p)=-\mathbb{E}[\log p(X)]$ within an…

Information Theory · Computer Science 2025-04-24 Tomer Berg , Or Ordentlich , Ofer Shayevitz

In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} of finite random words with $n$ independent letters drawn from a finite or infinite totally…

Probability · Mathematics 2021-11-05 Elahe Zohoorian Azad , Philippe Chassaing
‹ Prev 1 3 4 5 6 7 10 Next ›