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
01 Jan 2004
TL;DR: In this paper, the authors present range concatenation grammars, a syntactic formalism which possesses many attractive features, among which they emphasize here generative capacity and closure properties.
Abstract: We present Range Concatenation Grammars, a syntactic formalism which possesses many attractive features, among which we emphasize here generative capacity and closure properties. For example, Range Concatenation Grammars have stronger generative capacity than Linear Context-Free Rewriting Systems, although this power is not to the detriment of efficiency, since the generated languages can always be parsed in polynomial time. Range Concatenation Languages are closed under both intersection and complementation, and these closure properties suggest novel ways to describe some linguistic phenomena. We also present a parsing algorithm which is the basis for our current prototype implementation.
65 citations
TL;DR: The results imply undecidability of a number of decision problems of unary conjunctive grammars, as well as non-existence of a recursive function bounding the growth rate of the generated languages.
Abstract: It has recently been proved (Jez, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some non-regular languages over a one-letter alphabet. The present paper improves this result by constructing conjunctive grammars for a larger class of unary languages. The results imply undecidability of a number of decision problems of unary conjunctive grammars, as well as non-existence of a recursive function bounding the growth rate of the generated languages. An essential step of the argument is a simulation of a cellular automaton recognizing positional notation of numbers using language equations.
65 citations
21 Jul 2004
TL;DR: This paper investigates the generative capacity of GMTG, proves that each component grammar of a GMTG retains its generative power, and proposes a generalization of Chomsky Normal Form, which is necessary for synchronous CKY-style parsing.
Abstract: Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notational and intuitive simplicity of Context-Free Grammar (CFG). GMTG allows both synchronous and independent rewriting. Such flexibility facilitates more perspicuous modeling of parallel text than what is possible with other synchronous formalisms. This paper investigates the generative capacity of GMTG, proves that each component grammar of a GMTG retains its generative power, and proposes a generalization of Chomsky Normal Form, which is necessary for synchronous CKY-style parsing.
64 citations
TL;DR: It is shown that there effectively exists an algorithm that identifies a very simple grammar G equivalent to G* in the limit from positive data, satisfying the property that the time for updating a conjecture is bounded by O(m), and the total number of prediction errors made by the algorithm is boundedBy O(n), where n is the size of G*, m = Max{N|Σ |+1, |Σ|3} and N is the total length of all positive data provided
64 citations