Nonuniform Markov models

Details Nonuniform Markov models Nonuniform Markov models

1996-11-16

arxiv.org/abs/cmp-lg/9611004v1

Computer Science

Computation and Language

17 pages

Scientific paper

A statistical language model assigns probability to strings of arbitrary length. Unfortunately, it is not possible to gather reliable statistics on strings of arbitrary length from a finite corpus. Therefore, a statistical language model must decide that each symbol in a string depends on at most a small, finite number of other symbols in the string. In this report we propose a new way to model conditional independence in Markov models. The central feature of our nonuniform Markov model is that it makes predictions of varying lengths using contexts of varying lengths. Experiments on the Wall Street Journal reveal that the nonuniform model performs slightly better than the classic interpolated Markov model. This result is somewhat remarkable because both models contain identical numbers of parameters whose values are estimated in a similar manner. The only difference between the two models is how they combine the statistics of longer and shorter strings. Keywords: nonuniform Markov model, interpolated Markov model, conditional independence, statistical language model, discrete time series.

Affiliated with

Also associated with

No associations

Rating

Nonuniform Markov models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nonuniform Markov models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonuniform Markov models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-426361