A Formal Look at Dependency Grammars and Phrase-Structure Grammars, with Special Consideration of Word-Order Phenomena
| dc.creator | Rambow, Owen | |
| dc.creator | Joshi, Aravind | |
| dc.date | 1994-10-18 | |
| dc.date.accessioned | 2026-07-07T09:09:33Z | |
| dc.date.available | 2026-07-07T09:09:33Z | |
| dc.description | 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. | |
| dc.description | uuencoded compressed ps file, 20 pages | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9410007 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9410007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151075 | |
| dc.subject | Computation and Language | |
| dc.title | A Formal Look at Dependency Grammars and Phrase-Structure Grammars, with Special Consideration of Word-Order Phenomena | |
| dc.type | text |