Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 17 October 2018

Abstract and Keywords

Lexical-Functional Grammar (LFG) is a theory of generative grammar. The goal is to explain the native speaker's knowledge of language by specifying a grammar that models the speaker's knowledge explicitly and which is distinct from the computational mechanisms that constitute the language processor. This chapter is organized as follows. Section 15.2 discusses the two syntactic structures posited by LFG: constituent structure (c-structure) and functional structure (f-structure). LFG distinguishes between formal structures and structural descriptions that well-formed structures must satisfy. The structural descriptions are sets of constraints. A constraint is a statement that is either true or false of a structure. Section 15.3 provides an overview of the most important sorts of constraints. Section 17.4 explains how c-structure and f-structure are related by structural correspondences. Section 17.5 describes the Correspondence Architecture. Section 17.6 considers some recent developments in LFG.

Keywords: generative grammar, linguistic theory, constituent structure, functional structure, structural correspondence, Correspondence Architecture

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.