scispace - formally typeset
Search or ask a question
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
More filters
Book ChapterDOI
01 Sep 1990
TL;DR: In this article, the problem of attribute evaluation during LR parsing is considered and several definitions of LR-attributed grammars are presented, and relations of corresponding attribute grammar classes are analyzed.
Abstract: The problem of attribute evaluation during LR parsing is considered. Several definitions of LR-attributed grammars are presented. Relations of corresponding attribute grammar classes are analysed. Also the relations between LR-attributed grammars and LL-attributed grammars and between LR-attributed grammars and a class of one-pass attributed grammars based on left-corner grammars are considered.

12 citations

Journal ArticleDOI
TL;DR: It is shown that the equivalence problem for linear s-grammars is decidable in polynomial time.

11 citations

Journal ArticleDOI
TL;DR: Probabilistic grammars acting as information sources are considered and concepts from information theory defined by other authors are partly redefined and a specific probability assignment for maximizing the rate of a language source is found.
Abstract: Probabilistic grammars acting as information sources are considered and concepts from information theory defined by other authors are partly redefined. A specific probability assignment for maximizing the rate of a language source is found. Further, the problem of coding a language source is treated.

11 citations

01 Jan 1998
TL;DR: A genetic algorithm for learning stochastic context-free grammars from finite language samples as described as well as a number of experiments in learning Grammars for a range of formal languages.
Abstract: A genetic algorithm for learning stochastic context-free grammars from finite language samples as described. Solutions to the inference problem are evolved by optimising the parameters of a covering grammar for a given language sample. We describe a number of experiments in learning grammars for a range of formal languages. The results of these experiments are encouraging and compare favourably with other approaches to stochastic grammatical inference.

11 citations

Journal ArticleDOI
TL;DR: Grammars whose languages consist of cycles (“necklaces”) rather than strings are considered, and automata on cyclic tapes are also discussed.
Abstract: Grammars whose languages consist of cycles (“necklaces”) rather than strings are considered. If G is context free, and we regard G as generating cycles instead of strings, the resulting language is just what we would get if we “bent” the strings of L ( G ) into cycles. This is no longer true if G is context sensitive. However, in this case too, the context-sensitive cycle languages are just the “bendings” of the context-sensitive string languages. Automata on cyclic tapes are also discussed.

11 citations


Network Information
Related Topics (5)
Graph (abstract data type)
69.9K papers, 1.2M citations
85% related
Parsing
21.5K papers, 545.4K citations
85% related
Time complexity
36K papers, 879.5K citations
84% related
Semantics
24.9K papers, 653K citations
82% related
Tree (data structure)
44.9K papers, 749.6K citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202315
202225
20217
20205
20196
201811