Precise n-gram Probabilities from Stochastic Context-free Grammars

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.

12 pages, to appear in ACL-94

References in corpus (1)

• An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities

Cited by in corpus (6)

• An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities
• Robust Probabilistic Predictive Syntactic Processing
• Utilisation de la linguistique en reconnaissance de la parole : un état de l'art
• Thermodynamics of Information Retrieval
• Probabilistic top-down parsing and language modeling
• Practical experiments with regular approximation of context-free languages