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: 23 July 2018

Abstract and Keywords

Tree-adjoining grammar (TAG) and lexicalized tree-adjoining grammar (LTAG), have endured extensive study, in terms of formal properties and linguistic relevance. TAG and LTAG are formally equivalent. Structured trees, rather than strings, are manipulated by LTAG. The process of using structured elements as elementary to formal systems, facilitates the construction of formalisms whose studies relate directly to strong generative capacity (structural description), more linguistically relevant than the weak kind (string sets) each grammar formalisn specifies a domain of locality, a space over which various dependencies are specified. Key properties of LTAG include an extended domain of locality (EDL), which allows factoring recursion from domain of dependency (FRD), thereby, localizing all dependencies. Most modern formalisms, especially those with NL relevance, are lexicalized in a sense. Categorical grammars, especially combinatory categorical grammars (CCG), are also proximate to LATG. The key to comprehending TAG and LTAG, lies in realizing the notion of strong generative capacity of grammar formalisms.

Keywords: structured, tree, string, domain, grammar, formal

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.