Factored language model

The factored language model (FLM) is an extension of a conventional language model introduced by Jeff Bilmes and Katrin Kirchoff in 2003. In an FLM, each word is viewed as a vector of k factors:  w i = { f i 1 , . . . , f i k } . {\displaystyle w_{i}=\\{f_{i}^{1},...,f_{i}^{k}\\}.} An FLM provides the probabilistic model  P ( f | f 1 , . . . , f N ) {\displaystyle P(f|f_{1},...,f_{N})} where the prediction of a factor  f {\displaystyle f} is based on  N {\displaystyle N} parents  { f 1 , . . . , f N } {\displaystyle \\{f_{1},...,f_{N}\\}} . For example, if  w {\displaystyle w} represents a word token and  t {\displaystyle t} represents a Part of speech tag for English, the expression  P ( w i | w i − 2 , w i − 1 , t i − 1 ) {\displaystyle P(w_{i}|w_{i-2},w_{i-1},t_{i-1})} gives a model for predicting current word token based on a traditional Ngram model as well as the Part of speech tag of the previous word.

A major advantage of factored language models is that they allow users to specify linguistic knowledge such as the relationship between word tokens and Part of speech in English, or morphological information (stems, root, etc.) in Arabic.

Like N-gram models, smoothing techniques are necessary in parameter estimation. In particular, generalized back-off is used in training an FLM.

## References

[edit]

* J Bilmes and K Kirchhoff (2003). "Factored Language Models and Generalized Parallel Backoff" (PDF). Human Language Technology Conference. Archived from the original (PDF) on 17 July 2012.

This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.

|

* v
* t
* e

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template