Separating Dependency from Constituency in a Tree Rewriting System

Details Separating Dependency from Constituency in a Tree Rewriting System Separating Dependency from Constituency in a Tree Rewriting System

1998-09-18

arxiv.org/abs/cs/9809028v1

In Proceedings of the Fifth Meeting on Mathematics of Language, Saarbruecken, August 1997

Computer Science

Computation and Language

7 pages, 6 Postscript figures, uses fullname.sty

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Separating Dependency from Constituency in a Tree Rewriting System does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Separating Dependency from Constituency in a Tree Rewriting System, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Separating Dependency from Constituency in a Tree Rewriting System will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-458229