Acl-94 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… (More)

1 Figure or Table

Topics

  • Presentations referencing similar topics