Factored Language Models and Generalized Parallel Backoff

By J. Bilmes, Katrin Kirchhoff. North American Chapter of the Association for Computational Linguistics, 2003

332 citations recorded by the source corpus.

We introduce factored language models (FLMs) and generalized parallel backoff (GPB). An FLM represents words as bundles of features (e.g., morphological classes, stems, data-driven clusters, etc.), and induces a probability model covering sequences of bundles rather than just words. GPB extends standard backoff to general conditional probability tables where variables might be heterogeneous types, where no obvious natural (temporal) backoff order exists, and where multiple dynamic backoff strategies are allowed. These methodologies were implemented during the JHU 2002 workshop as extensions to the SRI language modeling toolkit. This paper provides initial perplexity results on both CallHome Arabic and on Penn Treebank Wall Street Journal articles. Significantly, FLMs with GPB can produce bigrams with significantly lower perplexity, sometimes lower than highly-optimized baseline trigrams. In a multi-pass speech recognition context, where bigrams are used to create first-pass bigram lattices or N-best lists, these results are highly relevant.

Subfields: Artificial Intelligence

View Paper: https://www.semanticscholar.org/paper/c20b4068be640ebaffbc56382c3e4e0bcf62664e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Graham Neubig
  2. Jianfeng Gao
  3. Luke S. Zettlemoyer
  4. Philipp Koehn
  5. Kyunghyun Cho
  6. Mohit Bansal
  7. Yoav Goldberg
  8. Noah A. Smith

Citations in the corpus