Projects per year
Latent-variable probabilistic context-free grammars are latent-variable models that are based on context-free grammars. Non-terminals are associated with latent states that provide contextual information during the top-down rewriting process of the grammar. We survey a few of the techniques used to estimate such grammars and to parse text with them. We also give an overview of what the latent states represent for English Penn treebank parsing, and provide an overview of extensions and related models to these grammars.
|Title of host publication||Proceedings of the 15th Meeting on the Mathematics of Language|
|Publisher||Association for Computational Linguistics (ACL)|
|Number of pages||12|
|Publication status||Published - 14 Jul 2017|
|Event||15th Meeting on the Mathematics of Language - London, United Kingdom|
Duration: 13 Jul 2017 → 14 Jul 2017
|Conference||15th Meeting on the Mathematics of Language|
|Abbreviated title||MOL 2017|
|Period||13/07/17 → 14/07/17|
FingerprintDive into the research topics of 'Latent-Variable PCFGs: Background and Applications'. Together they form a unique fingerprint.
- 1 Finished
1/02/16 → 31/01/19