Please use this identifier to cite or link to this item:
https://lib.hpu.edu.vn/handle/123456789/33149
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | O’Donnell, Timothy J. | en_US |
dc.date.accessioned | 2020-08-03T08:06:40Z | - |
dc.date.available | 2020-08-03T08:06:40Z | - |
dc.date.issued | 2016 | en_US |
dc.identifier.isbn | 9780262326803 | en_US |
dc.identifier.other | HPU2164026 | en_US |
dc.identifier.uri | https://lib.hpu.edu.vn/handle/123456789/33149 | - |
dc.description.abstract | Language allows us to express and comprehend an unbounded number of thoughts. This fundamental and much-celebrated property is made possible by a division of labour between a large inventory of stored items (e.g. affixes, words, idioms) and a computational system that productively combines these stored units on the fly to create a potentially unlimited array of new expressions. A language learner must discover a language's productive, reusable units and determine which computational processes can give rise to new expressions. But how does the learner differentiate between the reusable, generalizable units and apparent units that do not actually generalize in practice? In this book, Timothy O'Donnell proposes a formal computational model, 'Fragment Grammars', to answer these questions. | en_US |
dc.format.extent | 350p. | en_US |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en_US |
dc.publisher | MIT Press | en_US |
dc.subject | Psycholinguistics | en_US |
dc.subject | Mathematical models | en_US |
dc.subject | Memory | en_US |
dc.subject | Language | en_US |
dc.title | Productivity and Reuse in Language : A Theory of Linguistic Computation and Storage | en_US |
dc.type | Book | en_US |
dc.size | 4,69 MB | en_US |
dc.department | Sociology | en_US |
Appears in Collections: | Sociology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Productivity-and-Reuse-in-Language.pdf Restricted Access | 4.81 MB | Adobe PDF | ![]() View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.