Added to Favorites

Related Searches

Definitions

Nearby Words

Perplexity is a measurement in information theory. It is defined as 2 raised to the power of entropy, or more often as 2 raised to the power of cross-entropy. The latter definition is commonly used to compare probability models empirically.

The perplexity of a discrete probability distribution p is defined as

- $2^\{H(p)\}=2^\{-sum\_x\; p(x)log\_2\; p(x)\}$

where H(p) is the entropy of the distribution and x ranges over events.

One may also define the perplexity of a random variable X as the perplexity of the distribution over its possible values x.

It is easy to see that in the special case where p models a fair k-sided die (a uniform distribution over k discrete events), its perplexity is k. We may therefore regard any random variable with perplexity k as having the same uncertainty as a fair k-sided die. We are "k-ways perplexed" about the value of such a random variable. (Unless it is also a fair k-sided die, more than k values will be possible, but the overall uncertainty is no greater because some of these values will have probability greater than 1/k.)

Often one tries to model an unknown probability distribution p, based on a training sample that was drawn from p. Given a proposed probability model q, one may evaluate q by asking how well it predicts a separate test sample x_{1}, x_{2}, ..., x_{N} also drawn from p. The perplexity of the model q is defined as

- $2^\{-sum\_\{i=1\}^N\; frac\{1\}\{N\}\; log\_2\; q(x\_i)\}$

Better models q of the unknown distribution p will tend to assign higher probabilities q(x_{i}) to the test events. Thus, they have lower perplexity: they are less surprised by the test sample.

The exponent above may be regarded as the average number of bits needed to represent a test event x_{i} if one uses an optimal code based on q. Low-perplexity models do a better job of compressing the test sample, requiring few bits per test element on average because q(x_{i}) tends to be high.

The exponent may also be regarded as a cross-entropy,

- $H(tilde\{p\},q)\; =\; -sum\_x\; tilde\{p\}(x)\; log\_2\; q(x)$

where $tilde\{p\}$ denotes the empirical distribution of the test sample (i.e., $tilde\{p\}(x)\; =\; n/N$ if x appeared n times in the test sample of size N).

In natural language processing, perplexity is a common way of evaluating language models. A language model is a probability distribution over entire sentences or texts.

Using the definition above, one might find that the average sentence x_{i} in the test sample could be coded in 190 bits (i.e., the test sentences had an average log-probability of -190). This would give an enormous model perplexity of 2^{190} per sentence. However, it is more common to normalize for sentence length and consider only the number of bits per word. Thus, if the test sample's sentences comprised a total of 1,000 words, and could be coded using a total of 7,950 bits, one could report a model perplexity of 2^{7.95} = 247 per word. In other words, the model is as confused on test data as if it had to choose uniformly and independently among 247 possibilities for each word.

The lowest perplexity that has been published on the Brown Corpus (1 million words of American English of varying topics and genres) is indeed about 247 per word, corresponding to a cross-entropy of log_{2}247 = 7.95 bits per word or 1.75 bits per letter using a trigram model. It is often possible to achieve lower perplexity on more specialized corpora, as they are more predictable.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Friday May 30, 2008 at 15:52:08 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Friday May 30, 2008 at 15:52:08 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.