Factorization of Language Models through Backing-Off Lattices
| dc.creator | Wang, Wei | |
| dc.date | 2003-05-23 | |
| dc.date | 2003-05-26 | |
| dc.date.accessioned | 2026-07-07T03:19:43Z | |
| dc.date.available | 2026-07-07T03:19:43Z | |
| dc.description | 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. | |
| dc.description | 7 pages and 1 figure; technical report; added one more related work, and removed some errors | |
| dc.identifier | https://arxiv.org/abs/cs/0305041 | |
| dc.identifier | http://arxiv.org/abs/cs/0305041 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31575 | |
| dc.subject | Computation and Language | |
| dc.subject | I.2.7 | |
| dc.title | Factorization of Language Models through Backing-Off Lattices | |
| dc.type | text |