Separating Dependency from Constituency in a Tree Rewriting System
| dc.creator | Sarkar, Anoop | |
| dc.date | 1998-09-18 | |
| dc.date.accessioned | 2026-07-07T03:23:32Z | |
| dc.date.available | 2026-07-07T03:23:32Z | |
| dc.description | In this paper we present a new tree-rewriting formalism called Link-Sharing Tree Adjoining Grammar (LSTAG) which is a variant of synchronous TAGs. Using LSTAG we define an approach towards coordination where linguistic dependency is distinguished from the notion of constituency. Such an approach towards coordination that explicitly distinguishes dependencies from constituency gives a better formal understanding of its representation when compared to previous approaches that use tree-rewriting systems which conflate the two issues. | |
| dc.description | 7 pages, 6 Postscript figures, uses fullname.sty | |
| dc.identifier | https://arxiv.org/abs/cs/9809028 | |
| dc.identifier | http://arxiv.org/abs/cs/9809028 | |
| dc.identifier | In Proceedings of the Fifth Meeting on Mathematics of Language, Saarbruecken, August 1997 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32978 | |
| dc.subject | Computation and Language | |
| dc.subject | I.2.7; D.3.1 | |
| dc.title | Separating Dependency from Constituency in a Tree Rewriting System | |
| dc.type | text |