2026-09-20T00:44:23Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1061142026-06-06T00:54:55Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Robert C. Berwick. Indurkhya, Sagar Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2016-12-22T16:29:34Z 2016-12-22T16:29:34Z 2015 2015 http://hdl.handle.net/1721.1/106114 965796473 Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015. Cataloged from PDF version of thesis. Includes bibliographical references (pages 77-78). This thesis shows how to algorithmically construct a Minimalist Grammar lexicon that produces a specified set of MG derivations. This thesis introduces a mathematical structure, a Collection of Constraints, that captures the logical constraints, including those that arise as a consequence of the shortest move constraint, imposed upon the syntactic features of lexical items as they are merged together in a derivation produced by a given Minimalist Grammar lexicon. Methods are then developed that (a) map Minimalist Grammar lexicons to be Collections of Constraints, (b) map Collections of Constraints to Minimalist Grammar lexicons and (c) may combine two or more Collections of Constraints into a single Collection of Constraints. The thesis then demonstrates via a series of examples, framed as a simplified acquisition process, how these methods may be used together to iteratively construct a Minimalist Grammar lexicon starting from an empty Collection of Constraints and a sequence of Minimalist Grammar derivations, such that the constructed lexicon is able to generate the set of derivations. by Sagar Indurkhya. M.Eng. 78 pages eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Acquiring minimalist grammars via constraint satisfaction Thesis application/pdf Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="819195ff-d7b9-47f2-83c9-66295e3260a6"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Acquiring minimalist grammars via constraint satisfaction</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2015</PublicationDate> <Authors> <Author> <DisplayName>Indurkhya, Sagar</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>This thesis shows how to algorithmically construct a Minimalist Grammar lexicon that produces a specified set of MG derivations. This thesis introduces a mathematical structure, a Collection of Constraints, that captures the logical constraints, including those that arise as a consequence of the shortest move constraint, imposed upon the syntactic features of lexical items as they are merged together in a derivation produced by a given Minimalist Grammar lexicon. Methods are then developed that (a) map Minimalist Grammar lexicons to be Collections of Constraints, (b) map Collections of Constraints to Minimalist Grammar lexicons and (c) may combine two or more Collections of Constraints into a single Collection of Constraints. The thesis then demonstrates via a series of examples, framed as a simplified acquisition process, how these methods may be used together to iteratively construct a Minimalist Grammar lexicon starting from an empty Collection of Constraints and a sequence of Minimalist Grammar derivations, such that the constructed lexicon is able to generate the set of derivations.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>