Probabilistic Context-free Grammars — LT World

LT World

Supporters

provided by

dfki logo

with support by

eu star logofp7 logo

through

meta logo
clarin logo

as well as by

bmbf logo

through

take logo

N.B.

This site uses Google Analytics to record statistics about site visits - seeĀ Legal Information.

You are here: Home kb Information & Knowledge Technologies Probabilistic Context-free Grammars

Probabilistic Context-free Grammars


Trainable Grammars for Speech Recognition. James K. Baker.
Speech Communication Papers for ASA'97. 1979. 547-550.

Inside-Outside Estimation of a Lexicalized PCFG for German.
Franz Beil and Glenn Carroll and Detl



http://www.lt-world.org/hlt_survey/ltw-chapter3-7.pdf


A context-free grammar augmented with non-negative weights for all grammar rules resulting in a probability distribution for both the syntax trees and the language of the grammar. Probabilistic context-free grammars may be used (i) to disambiguate the analyses of a given sentence, and (ii) in language modeling.


PCFG; SCFG

Stochastic context-free grammar