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
Proceedings Article•
08 Aug 1983TL;DR: The aim of this paper is to show how LFG can be translated into DCG and that the procedural semantics of PROLOG provides an efficient tool for LFG-implementations in that it allows the construction of function structures directly during the parsing process.
Abstract: Lexical functional grammar (LFG) is an attempt to solve problems that arise in transformational grammar and ATN-formalisms (Bresnan, 1982). Another powerful formalism for describing natural languages follows from a method for expressing grammars in logic, due to Colmerauer (1970) and Kowalski (1974) called definite clause grammars(DCG) (Warren, Pereira, 1980). Both formalisms are a natural extension of context free grammars (CFG).
The aim of this paper is to show -how LFG can be translated into DCG -that the procedural semantics of PROLOG provides an efficient tool for LFG-implementations in that it allows the construction of function structures (f-structures) directly during the parsing process. i.e. it is not necessary to have a separate component which first derives a set of functional equations from the parse tree, and secondly generates a f-structure by solving these equations.
13 citations
01 Sep 2012
TL;DR: Pairs of context-free tree grammars combined through synchronous rewriting are considered and the resulting formalism is at least as powerful as synchronous tree adjoining Grammars and linear, nondeleting macro tree transducers, while the parsing complexity remains polynomial.
Abstract: We consider pairs of context-free tree grammars combined through synchronous rewriting The resulting formalism is at least as powerful as synchronous tree adjoining grammars and linear, nondeleting macro tree transducers, while the parsing complexity remains polynomial Its power is subsumed by context-free hypergraph grammars The new formalism has an alternative characterization in terms of bimorphisms An advantage over synchronous variants of linear context-free rewriting systems is the ability to specify tree-to-tree transductions
13 citations
01 Jun 1984
TL;DR: Compared with conventional context-free grammars (CFGs), RRP6s are more complex but offer in return several advantages, which improve readability through greater conciseness, avoid over-specification by uslng i t e r a t i o n instead of one-sided recursion.
Abstract: Regular r i gh t -pa r t grammars (RRPGs) are by now the accepted formalism for the d e f i n i t i o n of the context-free syntax of PLs. Compared with conventional context-free grammars (CFGs), RRP6s are more complex but offer in return several advantages. They improve readability through greater conciseness, avoid over-specification by uslng i t e r a t i o n instead of one-sided recursion, and may lead to oarsers more e f f i c i e n t in space and/or time.
13 citations
TL;DR: It is shown that any well-defined attribute grammar isk-visit for somek and that given a well- defined grammarG and an integerk, it is decidable whetherG isk -visit.
Abstract: It is shown that any well-defined attribute grammar isk-visit for somek. Furthermore it is shown that given a well-defined grammarG and an integerk, it is decidable whetherG isk-visit. Finally we show that thek-visit grammars specify a proper hierarchy with respect to translations.
13 citations