Factorization of Language Models through Backing-Off Lattices

Details Factorization of Language Models through Backing-Off Lattices Factorization of Language Models through Backing-Off Lattices

2003-05-23

arxiv.org/abs/cs/0305041v2

Computer Science

Computation and Language

7 pages and 1 figure; technical report; added one more related work, and removed some errors

Scientific paper

Factorization of statistical language models is the task that we resolve the most discriminative model into factored models and determine a new model by combining them so as to provide better estimate. Most of previous works mainly focus on factorizing models of sequential events, each of which allows only one factorization manner. To enable parallel factorization, which allows a model event to be resolved in more than one ways at the same time, we propose a general framework, where we adopt a backing-off lattice to reflect parallel factorizations and to define the paths along which a model is resolved into factored models, we use a mixture model to combine parallel paths in the lattice, and generalize Katz's backing-off method to integrate all the mixture models got by traversing the entire lattice. Based on this framework, we formulate two types of model factorizations that are used in natural language modeling.

Affiliated with

Also associated with

No associations

Rating

Factorization of Language Models through Backing-Off Lattices 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 Factorization of Language Models through Backing-Off Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Factorization of Language Models through Backing-Off Lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-133407