home kb Information and Knowledge Technologies Language Analysis Probabilistic Context-free Grammars Probabilistic Context-free Grammars
External Links
Google
Google Scholar
Citeseer
provided by
German Research Center for Artificial Intelligence
with support by
through
as well as by
through
 

Probabilistic Context-free Grammars

abbreviation(s): SCFG
definition: 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.
See also the corresponding HLT Survey chapter: http://www.lt-world.org/hlt_survey/ltw-chapter3-7.pdf
related project(s):
  • Shallow PARsing and Knowledge extraction for Language Engineering (SPARKLE)
related organisation(s):
related person(s):
  • James K. Baker
  • Eugene Charniak
  • Michael Collins
  • Mats Rooth
  • K. Lari
related system(s) / resource(s):
  • Collins' statistical parsers
  • LoPar
  • Charniak's statistical parsers
related publication(s):

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