Results 41 to 50 of about 22,181 (225)
Feature structures based Tree Adjoining Grammars [PDF]
Proceedings of the 12th conference on Computational linguistics -, 1988 We have embedded Tree Adjoining Grammars (TAG) in a feature structure based unification system. The resulting system, Feature Structure based Tree Adjoining Grammars (FTAG), captures the principle of factoring dependencies and recursion, fundamental to TAG's. We show that FTAG has an enhanced descriptive capacity compared to TAG formalism.
K. Vijay-Shanker, A. K. Joshi
openaire +1 more source
A syntax-semantics interface for Tree-Adjoining Grammars through Abstract Categorial Grammars
Journal of Language Modelling, 2018 We present a model of the syntax-semantics interface for Tree-Adjoining Grammars (TAGs). It is based on the encoding of TAGs within the framework of Abstract Categorial Grammars (ACGs).
Sylvain Pogodalla
doaj +1 more source
Wo stehen wir in der Grammatiktheorie? Bemerkungen anlässlich eines Buchs von Stefan Müller
Zeitschrift für Sprachwissenschaft, 2012 Stefan Müller’s recent introductory textbook, “Grammatiktheorie”, is an astonishingly comprehensive and insightful survey for beginning students of the present state of syntactic theory.
Sternefeld Wolfgang, Richter Frank
doaj +1 more source
TuLiPA : a syntax-semantics parsing environment for mildly context-sensitive formalisms [PDF]
, 2008 In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range ...
Dellert, Johannes +4 more
core +5 more sources
Constraining Tree Adjoining Grammars by unification [PDF]
Proceedings of the 13th conference on Computational linguistics -, 1990 In a proposal, Vijay-Shanker and Joshi presented a definition for combining the two formalisms Tree Adjoining Grammars and PATR unification. The essential idea for that combination is the separation of the two recursion operations - adjoining and unification - to preserve all properties of both formalisms which is not desirable for natural language ...
openaire +1 more source
A Lexicalized Tree-Adjoining Grammar for Vietnamese [PDF]
, 2006 In this paper, we present the first sizable grammar built for Vietnamese using LTAG, developed over the past two years, named vnLTAG. This grammar aims at modelling written language and is general enough to be both application- and domain-independent. It
Hong Phuong, L. +3 more
core +4 more sources
Disfluencies, language comprehension, and Tree Adjoining Grammars [PDF]
Cognitive Science, 2004 AbstractDisfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research focused on the way that disfluencies affect structure‐building operations during comprehension.
Fernanda Ferreira +2 more
openaire +2 more sources
The relationship between Tree Adjoining Grammars and Head Grammars [PDF]
Proceedings of the 24th annual meeting on Association for Computational Linguistics -, 1986 We examine the relationship between the two grammatical formalisms: Tree Adjoining Grammars and Head Grammars. We briefly investigate the weak equivalence of the two formalisms. We then turn to a discussion comparing the linguistic expressiveness of the two formalisms.
D. J. Weir +2 more
openaire +1 more source
LITURGICAL POLITICS IN THE POETRY OF PAUL CELAN*
German Life and Letters, Volume 78, Issue 2, Page 237-255, April 2025.ABSTRACT Drawing on Celan's conception of poetry as a means of orienting the individual towards the ‘completely Other’, this paper emphasises poetry's ability to create community without reproducing exclusionary group identities. The analysis reveals a latent politics in Celan's poetry, emphasising its ability to gather disparate individuals into a ...
Lukas Hoffman
wiley +1 more source
Parsing French with Tree Adjoining Grammar [PDF]
Proceedings of the 12th conference on Computational linguistics -, 1988 We present the first sizable grammar written for TAG. We present the linguistic coverage of our grammar, and explain the linguistic reasons which lead us to choose the particular representations. We show that TAG formalism provides sufficient constraints for handling most of the linguistic phenomena, with minimal linguistic stipulations. We first state
openaire +1 more source