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
TL;DR: State-alternating context-free grammars are introduced, and the language classes obtained from them are compared to the classes of the Chomsky hierarchy as well as to some well-known complexity classes.
17 citations
18 Sep 2002
TL;DR: This paper establishes their computational equivalence to linear conjunctive grammars, which are linear context-free Grammars extended with an explicit intersection operation, which allows to combine the known results on the generative power and closure properties of triangular trellis automata and linear conj unctive gramMars.
Abstract: Triangular trellis automata, also studied under the name of one-way real-time cellular automata, have been known for several decades as a purely abstract model of parallel computers. This paper establishes their computational equivalence to linear conjunctive grammars, which are linear context-free grammars extended with an explicit intersection operation. This equivalence allows to combine the known results on the generative power and closure properties of triangular trellis automata and linear conjunctive grammars and to obtain new previously unexpected results on this language family - for instance, to determine their exact relationship with other comparable families of languages.
17 citations
24 Jun 1990
TL;DR: Augmented phrase structure grammar (APSG) formalisms can express many of the relevant syntactic and semantic regularities of spoken language systems, but they are computationally less suitable for language modeling, because of the inherent cost of computing state transitions in APSG parsers.
Abstract: Grammars for spoken language systems are subject to the conflicting requirements of language modeling for recognition and of language analysis for sentence interpretation. Current recognition algorithms can most directly use finite-state acceptor (FSA) language models. However, these models are inadequate for language interpretation, since they cannot express the relevant syntactic and semantic regularities. Augmented phrase structure grammar (APSG) formalisms, such as unification grammars, can express many of those regularities, but they are computationally less suitable for language modeling, because of the inherent cost of computing state transitions in APSG parsers.
17 citations
19 Apr 1994
TL;DR: In this article, the authors present grammatical descriptions of the set of normal inhabitants of a given type under a given basis, both for the standard simple type system (in the partial discharge convention) and for the system in the total discharge convention (or the Prawitz style natural deduction system).
Abstract: We present grammatical (or equational) descriptions of the set of normal inhabitants {M|??M:A,Min?-normal form} of a given typeAunder a given basis?, both for the standard simple type system (in the partial discharge convention) and for the system in the total discharge convention (or the Prawitz-style natural deduction system). It is shown that in the latter system we can describe the set by a (finite) context-free grammar, but for the standard system this is not necessarily the case because we may need an infinite supply of fresh (bound) variables to describe the set. In both cases, however, our grammars reflect the structure of normal inhabitants in such a way that, when non-terminals are ignored, a derivation tree of the grammars yielding a?-termMcan be identified with B?hm tree ofM. We give some applications of the grammatical descriptions. Among others, we give simple algorithms for the emptiness/finiteness problem of the set of normal inhabitants of a given type (both for the standard and nonstandard systems).
17 citations
06 Jan 2013
TL;DR: It is shown that every language without the empty word generated by a displacement context-free grammar can be also generated by displacement Lambek grammars.
Abstract: We introduce a new grammar formalism, the displacement context-free grammars, which is equivalent to well-nested multiple context-free grammars. We generalize the notions of Chomsky and Greibach normal forms for these grammars and show that every language without the empty word generated by a displacement context-free grammar can be also generated by displacement Lambek grammars.
17 citations