Show simple item record

Fragment Grammars: Exploring Computation and Reuse in Language

dc.date.accessioned2009-03-31T05:00:03Z
dc.date.accessioned2018-11-26T22:25:56Z
dc.date.available2009-03-31T05:00:03Z
dc.date.available2018-11-26T22:25:56Z
dc.date.issued2009-03-31
dc.identifier.citationO'DONNELL, T., GOODMAN, N., and TENENBAUM, J. 2009. Fragment Grammars: Exploring Computation and Reuse in Language. MIT Computer Science and Artificial Intelligence Laboratory Technical Report Series, MIT-CSAIL-TR-2009-013.
dc.identifier.urihttp://hdl.handle.net/1721.1/44963
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/44963
dc.description.abstractLanguage relies on a division of labor between stored units and structure building operations which combine the stored units into larger structures. This division of labor leads to a tradeoff: more structure-building means less need to store while more storage means less need to compute structure. We develop a hierarchical Bayesian model called fragment grammar to explore the optimum balance between structure-building and reuse. The model is developed in the context of stochastic functional programming (SFP) and in particular using a probabilistic variant of Lisp known as the Church programming language (Goodman, Mansinghka, Roy, Bonawitz, & Tenenbaum, 2008). We show how to formalize several probabilistic models of language structure using Church, and how fragment grammar generalizes one of them---adaptor grammars (Johnson, Griffiths, & Goldwater, 2007). We conclude with experimental data with adults and preliminary evaluations of the model on natural language corpus data.en_US
dc.format.extent63 p.en_US
dc.subjectLanguageen_US
dc.subjectStochastic Functional Programmingen_US
dc.subjectStochastic Memoizationen_US
dc.subjectReuseen_US
dc.subjectLexiconen_US
dc.subjectHierarchical Bayesen_US
dc.titleFragment Grammars: Exploring Computation and Reuse in Languageen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2009-013.pdf1.696Mbapplication/pdfView/Open
MIT-CSAIL-TR-2009-013.ps6.012Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record