D-tree grammars

Owen Rambow; K. Vijay-Shanker; David Weir

D-tree grammars

Owen Rambow
, K. Vijay-Shanker
, David Weir

Linguistics

University of Delaware
University of Sussex

Research output: Contribution to journal › Conference article › peer-review

56 Scopus citations

Abstract

DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two composition operations called subsertion and sister-adjunction. The most distinctive feature of DTG is that, unlike TAG, there is complete uniformity in the way that the two DTG operations relate lexical items: subsertion always corresponds to complementation and sister-adjunction to modification. Furthermore, DTG, unlike TAG, can provide a uniform analysis for whmovement in English and Kashmiri, despite the fact that the wh element in Kashmiri appears in sentence-second position, and not sentence-initial position as in English.

Original language	English
Pages (from-to)	151-158
Number of pages	8
Journal	Proceedings of the Annual Meeting of the Association for Computational Linguistics
Volume	1995-June
State	Published - 1995
Event	33rd Annual Meeting of the Association for Computational Linguistics, ACL 1995 - Cambridge, United States Duration: Jun 26 1995 → Jun 30 1995

Cite this

@article{100b6245e48a4afb8ae5ca5838117ad5,

title = "D-tree grammars",

abstract = "DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two composition operations called subsertion and sister-adjunction. The most distinctive feature of DTG is that, unlike TAG, there is complete uniformity in the way that the two DTG operations relate lexical items: subsertion always corresponds to complementation and sister-adjunction to modification. Furthermore, DTG, unlike TAG, can provide a uniform analysis for whmovement in English and Kashmiri, despite the fact that the wh element in Kashmiri appears in sentence-second position, and not sentence-initial position as in English.",

author = "Owen Rambow and K. Vijay-Shanker and David Weir",

note = "Publisher Copyright: {\textcopyright} ACL 1995.All right reserved.; 33rd Annual Meeting of the Association for Computational Linguistics, ACL 1995 ; Conference date: 26-06-1995 Through 30-06-1995",

year = "1995",

language = "English",

volume = "1995-June",

pages = "151--158",

journal = "Proceedings of the Annual Meeting of the Association for Computational Linguistics",

issn = "0736-587X",

}

TY - JOUR

T1 - D-tree grammars

AU - Rambow, Owen

AU - Vijay-Shanker, K.

AU - Weir, David

PY - 1995

Y1 - 1995

N2 - DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two composition operations called subsertion and sister-adjunction. The most distinctive feature of DTG is that, unlike TAG, there is complete uniformity in the way that the two DTG operations relate lexical items: subsertion always corresponds to complementation and sister-adjunction to modification. Furthermore, DTG, unlike TAG, can provide a uniform analysis for whmovement in English and Kashmiri, despite the fact that the wh element in Kashmiri appears in sentence-second position, and not sentence-initial position as in English.

AB - DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two composition operations called subsertion and sister-adjunction. The most distinctive feature of DTG is that, unlike TAG, there is complete uniformity in the way that the two DTG operations relate lexical items: subsertion always corresponds to complementation and sister-adjunction to modification. Furthermore, DTG, unlike TAG, can provide a uniform analysis for whmovement in English and Kashmiri, despite the fact that the wh element in Kashmiri appears in sentence-second position, and not sentence-initial position as in English.

UR - https://www.scopus.com/pages/publications/78650685983

M3 - Conference article

AN - SCOPUS:78650685983

SN - 0736-587X

VL - 1995-June

SP - 151

EP - 158

JO - Proceedings of the Annual Meeting of the Association for Computational Linguistics

JF - Proceedings of the Annual Meeting of the Association for Computational Linguistics

T2 - 33rd Annual Meeting of the Association for Computational Linguistics, ACL 1995

Y2 - 26 June 1995 through 30 June 1995

ER -

D-tree grammars

Abstract

Other files and links

Fingerprint

Cite this