Simple Robust Grammar Induction with Combinatory Categorial Grammars
Abstract
We present a simple EM-based grammar induction algorithm for Combinatory Categorial Grammar (CCG) that achieves state-of-the-art performance by relying on a minimal number of very general linguistic principles. Unlike previous work on unsupervised parsing with CCGs, our approach has no prior language-specific knowledge, and discovers all categories automatically. Additionally, unlike other approaches, our grammar remains robust when parsing longer sentences, performing as well as or better than other systems. We believe this is a natural result of using an expressive grammar formalism with an extended domain of locality.
Cite
Text
Bisk and Hockenmaier. "Simple Robust Grammar Induction with Combinatory Categorial Grammars." AAAI Conference on Artificial Intelligence, 2012. doi:10.1609/AAAI.V26I1.8355Markdown
[Bisk and Hockenmaier. "Simple Robust Grammar Induction with Combinatory Categorial Grammars." AAAI Conference on Artificial Intelligence, 2012.](https://mlanthology.org/aaai/2012/bisk2012aaai-simple/) doi:10.1609/AAAI.V26I1.8355BibTeX
@inproceedings{bisk2012aaai-simple,
title = {{Simple Robust Grammar Induction with Combinatory Categorial Grammars}},
author = {Bisk, Yonatan and Hockenmaier, Julia},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2012},
pages = {1643-1649},
doi = {10.1609/AAAI.V26I1.8355},
url = {https://mlanthology.org/aaai/2012/bisk2012aaai-simple/}
}