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: 19 June 2019

Abstract and Keywords

Lexical-Functional Grammar (LFG) is a lexicalist, declarative (non-transformational), constraintbased theory of generative grammar. LFG has a detailed, industrial-strength computational implementation. The theory has also proven useful for descriptive/documentary linguistics. The grammatical architecture of LFG, sometimes called the “Correspondence Architecture,” posits that different kinds of linguistic information are modelled by distinct, simultaneously present grammatical structures, each having its own formal representation. These separate structures are formally related by correspondence functions. The different grammatical structures are subject to separate principles and formal descriptions and have distinct primitives. The two core syntactic structures are constituent structure and functional structure, and they are the central focus of this chapter. Other grammatical structures that have been proposed concern argument structure, information structure, semantics and the syntax–semantics interface, prosody and the syntax–phonology interface, and the morphology–syntax interface.

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.