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.
Latent-Variable PCFGs: Background and Applications
Published 2017 in Mathematics of Language
ABSTRACT
PUBLICATION RECORD
- Publication year
2017
- Venue
Mathematics of Language
- Publication date
Unknown publication date
- Fields of study
Linguistics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-55 of 55 references · Page 1 of 1
CITED BY
Showing 1-5 of 5 citing papers · Page 1 of 1