Factored language model: Difference between revisions

Revision as of 02:30, 6 July 2006

Revision as of 14:54, 19 August 2006

Line 1:

{{linkless-date|August 2006}}

The '''factored language model''' ('''FLM''') is an extension of conventional [[Language model]]. In an FLM, each word is viewed as a vector of ''k'' factors: <math>w_i = \{f_i^1, ..., f_i^k\}</math>. An FLM provides the probabilistic model <math>P(f|f_i, ..., f_N)</math> where the prediction of factor <math>f</math> is based on <math>N</math> parents <math>\{f_1, ..., f_N\}</math>. For an example, if <math>w</math> represents word token and <math>t</math> represents [[Part of speech]] tag for English, the model <math>P(w_i|w_{i-2}, w_{i-1}, t_{i-1})</math> gives a model for predicting current work token based on traditional [[Ngram]] model as well as [[Part of speech]] tag of the previous word.

Line 8 ⟶ 9:

*{{cite conference | author=J Bilmes and K Kirchhoff | url=http://ssli.ee.washington.edu/people/bilmes/mypapers/hlt03.pdf | title=Factored Language Models and Generalized Parallel Backoff | booktitle=Human Language Technology Conference | pages= | year=2003}}

{{compu-AI-stub}}

[[Category:Computational linguistics]]

[[Category:Natural language processing]]

{{compu-AI-stub}}