Separating Dependency from Constituency in a Tree Rewriting System

TL;DR

This paper introduces Link-Sharing Tree Adjoining Grammar (LSTAG), a formalism that separates dependency relations from constituency in tree rewriting, enhancing linguistic analysis of coordination.

Contribution

The paper proposes LSTAG, a novel tree-rewriting formalism that explicitly distinguishes dependency from constituency, improving theoretical understanding of coordination.

Findings

LSTAG effectively separates dependency and constituency.

Provides a clearer formal framework for coordination analysis.

Enhances linguistic modeling with a new tree-rewriting approach.

Abstract

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.