Topic
Tree-adjoining grammar
About: Tree-adjoining grammar is a research topic. Over the lifetime, 2491 publications have been published within this topic receiving 57813 citations.
Papers published on a yearly basis
Papers
More filters
10 Jul 1986
TL;DR: The relationship between the two grammatical formalisms: Tree Adjoining Grammars and Head Grammar is examined and a discussion comparing the linguistic expressiveness of the two formalisms is discussed.
Abstract: 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.
18 citations
23 Aug 1992
TL;DR: The method is easily adapted to allow incremental processing of Lambek grammars, a possibility that has hitherto been unavailable, and an extension proposed for handling locality phenomena.
Abstract: This paper describes a method for chart parsing Lambek grammars. The method is of particular interest in two regards. Firstly, it allows efficient processing of grammars which use necessity operators, an extension proposed for handling locality phenomena. Secondly, the method is easily adapted to allow incremental processing of Lambek grammars, a possibility that has hitherto been unavailable.
18 citations
28 Jul 2007
TL;DR: A new characterization of the generative capacity of Minimalist Grammar makes it possible to discuss the linguistic relevance of non-projectivity and illnestedness, and provides insight into grammars that derive structures with these properties.
Abstract: This paper provides an interpretation of Minimalist Grammars [16,17] in terms of dependency structures. Under this interpretation, merge operations derive projective dependency structures, and movement operations introduce both non-projectivity and illnestedness. This new characterization of the generative capacity of Minimalist Grammar makes it possible to discuss the linguistic relevance of non-projectivity and illnestedness. This in turn provides insight into grammars that derive structures with these properties.
18 citations
TL;DR: This paper deals with the problem of computing relations from their abstract non-algorithmic specifications, and a notion of the relation specified by a two-level grammar is introduced and computability of such relations is discussed.
18 citations