D-Tree substitution grammars

Rambow, Owen, Vijay-Shanker, K. and Weir, David (2001) D-Tree substitution grammars. Computational Linguistics, 27 (1). pp. 87-121. ISSN 0891-2017

[img]
Preview
PDF
Download (364kB) | Preview

Abstract

There is considerable interest among computational linguists in lexicalized grammatical frame-works; lexicalized tree adjoining grammar (LTAG) is one widely studied example. In this paper, we investigate how derivations in LTAG can be viewed not as manipulations of trees but as manipulations of tree descriptions. Changing the way the lexicalized formalism is viewed raises questions as to the desirability of certain aspects of the formalism. We present a new formalism, d-tree substitution grammar (DSG). Derivations in DSG involve the composition of d-trees, special kinds of tree descriptions. Trees are read off from derived d-trees. We show how the DSG formalism, which is designed to inherit many of the characterestics of LTAG, can be used to express a variety of linguistic analyses not available in LTAG.

Item Type: Article
Schools and Departments: School of Engineering and Informatics > Informatics
Subjects: Q Science > QA Mathematics > QA0075 Electronic computers. Computer science
Q Science > QA Mathematics > QA0076 Computer software
Depositing User: David Weir
Date Deposited: 21 Nov 2006
Last Modified: 12 Mar 2017 06:09
URI: http://sro.sussex.ac.uk/id/eprint/500
Google Scholar:49 Citations

View download statistics for this item

📧 Request an update