Abstract
Work in grammar induction should help shed light on the amount of syntactic structure that is discoverable from raw word or tag sequences. But since most current grammar induction algorithms produce unlabeled dependencies, it is difficult to analyze what types of constructions these algorithms can or cannot capture, and, therefore, to identify where additional supervision may be necessary. This paper provides an in-depth analysis of the errors made by unsupervised CCG parsers by evaluating them against the labeled dependencies in CCGbank, hinting at new research directions necessary for progress in grammar induction.
Cite
CITATION STYLE
Bisk, Y., & Hockenmaier, J. (2015). Probing the linguistic strengths and limitations of unsupervised grammar induction. In ACL-IJCNLP 2015 - 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, Proceedings of the Conference (Vol. 1, pp. 1395–1404). Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/p15-1135
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
