Jump to ContentJump to Main Navigation
Merging FeaturesComputation, Interpretation, and Acquisition$
Users without a subscription are not able to see the full content.

José M. Brucart, Anna Gavarró, and Jaume Solà

Print publication date: 2009

Print ISBN-13: 9780199553266

Published to Oxford Scholarship Online: May 2009

DOI: 10.1093/acprof:oso/9780199553266.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 21 September 2019

Merge and features: a minimalist introduction

Merge and features: a minimalist introduction

Chapter:
(p.1) 1 Merge and features: a minimalist introduction
Source:
Merging Features
Author(s):

José M. Brucart

Anna Gavarró

Jaume Solà (Contributor Webpage)

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199553266.003.0001

This book is about features and merge, and, more specifically, about the intricate ways they interact in generating expressions in natural languages. This introductory chapter is divided into two parts. The first part offers a brief scotch of the tenets of the Minimalist Program, which constitutes the current mainstream version of generative grammar. The second part discusses how the contributions included in the present book address some fundamental questions raised by it.

Keywords:   features, merge, Minimalist Program, generative grammar, natural language, external merge, internal merge, computational system, formal features, interpretable features

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .