Discriminative Log-Linear Grammars with Latent Variables


. Grammars with Latent Variables Given a treebank over a set of categories learn an optimally refined grammar for parsing. The parameters can be learned with an Expectation Maximization algorithm. The E-Step involves computing expectations over derivations corresponding to the observed trees. These expectations are normalized in the M-Step to update the… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

80 Citations

Semantic Scholar estimates that this publication has 80 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics