Estimating Compact Yet Rich Tree Insertion Grammars

DSpace/Manakin Repository

Estimating Compact Yet Rich Tree Insertion Grammars

Citable link to this page

. . . . . .

Title: Estimating Compact Yet Rich Tree Insertion Grammars
Author: Yamangil, Elif; Shieber, Stuart M.

Note: Order does not necessarily reflect citation order of authors.

Citation: Yamangil, Elif and Stuart M. Shieber. 2012. Estimating Compact Yet Rich Tree Insertion Grammars. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, Jeju, Republic of Korea, 8-14 July, 2012. Association for Computational Linguistics. 110-114.
Full Text & Related Files:
Abstract: We present a Bayesian nonparametric model for estimating tree insertion grammars (TIG), building upon recent work in Bayesian inference of tree substitution grammars (TSG) via Dirichlet processes. Under our general variant of TIG, grammars are estimated via the Metropolis-Hastings algorithm that uses a context free grammar transformation as a proposal, which allows for cubic-time string parsing as well as tree-wide joint sampling of derivations in the spirit of Cohn and Blunsom (2010). We use the Penn treebank for our experiments and find that our proposal Bayesian TIG model not only has competitive parsing performance but also finds compact yet linguistically rich TIG representations of the data.
Published Version: http://aclweb.org/anthology/P/P12/P12-2022.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:11326230

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [6464]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters