Journal ArticleDOI
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars
Stephan Kepser,James Rogers +1 more
Reads0
Chats0
TLDR
The equivalence of tree languages and monadic linear context-free grammars was shown by as discussed by the authors, who showed that a tree language is a member of this class iff it is the two-dimensional yield of an MSO-definable three-dimensional tree language.Abstract:
The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language class showing that a tree language is a member of this class iff it is the two-dimensional yield of an MSO-definable three-dimensional tree language.read more
Citations
More filters
Local and transderivational constraints in syntax and semantics
Edward P. Stabler,Thomas Graf +1 more
TL;DR: In this article, it was shown that Minimalist syntax can express a constraint purely via the operation Merge iff computing said constraint requires only a finitely bounded amount of working memory.
Journal ArticleDOI
Inverse linking via function composition
TL;DR: In this paper, an LF-movement style approach to the syntax-semantics interface is used to derive all and only the appropriate meanings for such constructions using no semantic operations other than function application and composition.
Journal ArticleDOI
Multidimensional trees and a Chomsky–Schützenberger–Weir representation theorem for simple context-free tree grammars
TL;DR: This paper presents a natural generalization of the original Chomsky-Schutzenberger theorem to the tree languages of simple context-free tree grammars, using Rogers’s notion of multi-dimensional trees to state this latter theorem in a very general, abstract form.
Proceedings Article
Strong Lexicalization of Tree Adjoining Grammars
Andreas Maletti,Joost Engelfriet +1 more
TL;DR: Simple context-free tree grammar strongly lexicalize tree adjoining grammars and themselves, in which each production contains a lexical symbol.
Journal ArticleDOI
LF-copying without LF
TL;DR: In the context of a compositional semantic interpretation scheme, the derivational copying approach to ellipsis presented here is revealed to be a particular instance of a proform theory, thus showing that the distinctions between, and arguments about, syntactic and semantic theories of ellipsi need to be revisited.
References
More filters
Journal ArticleDOI
Tree adjunct grammars
TL;DR: A tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd and Rounds and to the recognizable sets and local sets discussed by Thatcher.
Book ChapterDOI
Tree-adjoining grammars
Aravind K. Joshi,Yves Schabes +1 more
TL;DR: A tree generating system called tree-adjoining grammar (TAG) is described and a number of formal results have been established for TAGs, which are of interest to researchers in formal languages and automata, including those interested in tree grammars and tree automata.
Journal ArticleDOI
IO and OI. II
TL;DR: Several “Mezei-and-Wright-like” results are obtained which relate the context-free tree languages to recognizable tree languages and to nondeterministic recursive program(scheme)s (called by value and called by name).