A Formal Look at Dependency Grammars and Phrase-Structure Grammars, with Special Consideration of Word-Order Phenomena

1994/10/18 by Owen Rambow, Rambow, Owen, Aravind Joshi +1
Computer Science · #Computation and Language (cs.CL) #FOS: Computer and information sciences #cmp-lg #cs.CL

paper · pdf · doi:10.48550/arxiv.cmp-lg/9410007

uuencoded compressed ps file, 20 pages

arxiv created 1994/10/18 · arxiv updated 2009/11/30

Abstract

The central role of the lexicon in Meaning-Text Theory (MTT) and other dependency-based linguistic theories cannot be replicated in linguistic theories based on context-free grammars (CFGs). We describe Tree Adjoining Grammar (TAG) as a system that arises naturally in the process of lexicalizing CFGs. A TAG grammar can therefore be compared directly to an Meaning-Text Model (MTM). We illustrate this point by discussing the computational complexity of certain non-projective constructions, and suggest a way of incorporating locality of word-order definitions into the Surface-Syntactic Component of MTT.

Related

• Separating Surface Order and Syntactic Relations in a Dependency Grammar
• Proposing TAGbank as a Corpus of Tree-Adjoining Grammar Derivations
• An Empirically Motivated Reinterpretation of Dependency Grammar
• Anchoring a Lexicalized Tree-Adjoining Grammar for Discourse
• A Projection Architecture for Dependency Grammar and How it Compares to LFG