Wrapping of trees
Pages 558 - es
Abstract
We explore the descriptive power, in terms of syntactic phenomena, of a formalism that extends Tree-Adjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition to the three levels TAG already employs. While extending the descriptive power minimally, the additional level of decomposition allows us to obtain a uniform account of a range of phenomena that has heretofore been difficult to encompass, an account that employs unitary elementary structures and eschews synchronized derivation operations, and which is, in many respects, closer to the spirit of the intuitions underlying TAG-based linguistic theory than previously considered extensions to TAG.
References
[1]
Robert Evan Frank. 1992. Syntactic Locality and Tree Adjoining Grammar: Grammatical, Acquisition and Processing Perspectives. Ph.D. dissertation, Univ. of Penn.
[2]
Robert Frank. 2002. Phrase Structure Composition and Syntactic Dependencies. MIT Press.
[3]
The XTAG Research Group. 1998. A lexicalized tree adjoining grammar for english. Technical Report IRCS-98-18, Institute for Research in Cognitive Science.
[4]
Aravind K. Joshi and Yves Schabes. 1997. Tree-adjoining grammars. In Handbook of Formal Languages and Automata, volume 3, pages 69--123. Springer-Verlag.
[5]
Aravind K. Joshi, Leon Levy, and Masako Takahashi. 1975. Tree adjunct grammars. Journal of the Computer and Systems Sciences, 10:136--163.
[6]
Anthony Kroch and Aravind K. Joshi. 1985. The linquistic relevance of tree adjoining grammar. Technical Report MS-CS-85-16, Dept. of Computer and Information Sciences.
[7]
Anthony S. Kroch and Aravind K. Joshi. 1987. Analyzing extraposition in a tree adjoining grammar. In Syntax and Semantics, pages 107--149. Academic Press. Vol. 20.
[8]
Anthony Kroch. 1989. Asymmetries in long distance extraction in a tree adjoining grammar. In Mark Baltin and Anthony Kroch, editors, Alternative Conceptions of Phrase Structure, pages 66--98. University of Chicago Press.
[9]
Michael A. Palis and Sunil M. Shende. 1992. Upper bounds on recognition of a hierarchy of non-context-free languages. Theoretical Computer Science, 98:289--319.
[10]
James Rogers. 2002. One more perspective on semantic relations in TAG. In Proceedings of the Sixth International Workshop on Tree Adjoining Grammars and Related Frameworks, Venice, IT, May.
[11]
James Rogers. 2003. Syntactic structures as multidimensional trees. Research on Language and Computation, 1(3-4): 265--305.
[12]
K. Vijay-Shanker and Aravind K. Joshi. 1991. Unification based tree adjoining grammars. In J. Wedekind, editor, Unification-based Grammars. MIT Press, Cambridge, MA.
[13]
David J. Weir. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania.
[14]
David J. Weir. 1992. A geometric hierarchy beyond context-free languages. Theoretical Computer Science, 104:235--261.
Recommendations
On the Mild Context-Sensitivity of k-Tree Wrapping Grammar
Proceedings of the 20th and 21st International Conferences on Formal Grammar - Volume 9804Tree Wrapping Grammar TWG has been proposed in the context of formalizing the syntactic inventory of Role and Reference Grammar RRG. It is close to Tree Adjoining Grammar TAG while capturing predicate-argument dependencies in a more appropriate way and ...
Tree adjoining and head wrapping
COLING '86: Proceedings of the 11th coference on Computational linguisticsIn this paper we discuss the formal relationship between thw classes of languages generated by Tree Adjoining Grammars and Head Grammars. In particular, we show that Head Languages are included in Tree Adjoining Languages and that Tree Adjoining ...
Discontinuous constituent in trees, rules, and parsing
EACL '87: Proceedings of the third conference on European chapter of the Association for Computational LinguisticsThis paper discusses the consequences of allowing discontinuous constituents in syntactic representions and phrase-structure rules, and the resulting complications for a standard parser of phrase-structure grammar.It is argued, first, that discontinuous ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computational Linguistics
United States
Publication History
Published: 21 July 2004
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 85 of 443 submissions, 19%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 161Total Downloads
- Downloads (Last 12 months)25
- Downloads (Last 6 weeks)3
Reflects downloads up to 04 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in