0
Compound Probabilistic Context-Free Grammars for Grammar Induction
Yoon Kim, Chris Dyer, Alexander Rush, 2019. Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics.
Proposes compound probabilistic context-free grammars, whose rule probabilities vary with a per-sentence latent variable, for learning grammars from raw text; tested on English and Chinese.
What it's used for here
The inductive methods survey lists it among lower-priority grammar-induction methods, worth one run as a negative control because the Voynich text carries little word-order information.
Cited by on this site 1 record
1 methods surveys
SRCInductive methods
Cite it
Kim, Y., Dyer, C., & Rush, A. (2019). Compound Probabilistic Context-Free Grammars for Grammar Induction. Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics. https://doi.org/10.18653/v1/p19-1228
@article{kim2019compound,
author = {Kim, Yoon and Dyer, Chris and Rush, Alexander},
title = {Compound Probabilistic Context-Free Grammars for Grammar Induction},
journal = {Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics},
year = {2019},
doi = {10.18653/v1/p19-1228},
url = {https://doi.org/10.18653/v1/p19-1228}
}TY - JOUR TI - Compound Probabilistic Context-Free Grammars for Grammar Induction AU - Kim, Yoon AU - Dyer, Chris AU - Rush, Alexander PY - 2019 JO - Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics DO - 10.18653/v1/p19-1228 UR - https://doi.org/10.18653/v1/p19-1228 ER -
Kim, Yoon et al.. “Compound Probabilistic Context-Free Grammars for Grammar Induction.” Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics (2019). https://doi.org/10.18653/v1/p19-1228.