Article Instance
API Endpoint for journals.
GET /api/articles/32948/?format=api
{ "pk": 32948, "title": "A Computational Basis for Brown's Results on Morpheme Order Acquisition", "subtitle": null, "abstract": "This paper presents the result that a computer program can mimic the acquisition by children of a sdected set of grammatical morphemes. Roger Brown [Brown, 1973] studied the acquisition of 14 morphemes, and showed how a set of partial order relations describes this aspect of child language learning. W e show that these relations can be given a computational basis. They follow directly from a class of Boolean learning algorithms which have three simple constraints in the manner in which they consider hypotheses. I will call these three constraints the C A M constraints. C A M constraint 1 is to increase the length of the conjuncts one term at a time. The second C A M constraint is to consider all hypotheses of the same length simultaneously. Finally, C A M constraint 3 is to collect all single-term hypotheses involving noun features into a single conjunction prior to Boolean learning.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Poster Presentations", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/68g3f8wv", "frozenauthors": [ { "first_name": "Sheldon", "middle_name": "", "last_name": "Nicholl", "name_suffix": "", "institution": "University of Illinois", "department": "" }, { "first_name": "David", "middle_name": "C.", "last_name": "Wilkins", "name_suffix": "", "institution": "University of Illinois", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1991-01-01T18:00:00Z", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/32948/galley/24008/download/" } ] }