Precise n-gram Probabilities from Stochastic Context-free Grammars

TitlePrecise n-gram Probabilities from Stochastic Context-free Grammars
Publication TypeTechnical Report
Year of Publication1994
AuthorsStolcke, A., & Segal J.
Other Numbers877
Abstract

We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-grams (estimation from sparse data, lack of linguistic structure, among others). The method operates via the computation of substring expectations, which in turn is accomplished by solving systems of linear equations derived from the grammar. We discuss efficient implementation of the algorithm and report our practical experience with it.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1994/tr-94-007.pdf
Bibliographic Notes

ICSI Technical Report TR-94-007

Abbreviated Authors

A. Stolcke and J. Segal

ICSI Publication Type

Technical Report