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
05 Mar 1990
TL;DR: S-HH grammars have the same graph generating power as the vertex rewriting context-free NCE graph Grammars, and as recursive systems of equations with four types of simple operations on graphs.
Abstract: Separated handle-rewriting hypergraph grammars (S-HH grammars) are introduced, where separated means that the nonterminal handles are disjoint. S-HH grammars have the same graph generating power as the vertex rewriting context-free NCE graph grammars, and as recursive systems of equations with four types of simple operations on graphs.
42 citations
22 Jun 1993
TL;DR: Lexicalized context-free grammar supports much of the elegance of LTAG's analysis of English and shares with LTAG the ability to lexicalize CFGS without changing the trees generated.
Abstract: Lexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that can only generate context-free languages and can be parsed in cubic time. However, LCFG supports much of the elegance of LTAG's analysis of English and shares with LTAG the ability to lexicalize CFGS without changing the trees generated.
42 citations
Journal Article•
TL;DR: The computational problem of parsing a sentence in a tree-adjoining language is investigated and it is shown that any algorithm for the solution of the former problem can easily be converted into an algorithm to solve the latter problem.
Abstract: The computational problem of parsing a sentence in a tree-adjoining language is investigated. An interesting relation is studied between this problem and the well-known computational problem of Boolean matrix multiplication: it is shown that any algorithm for the solution of the former problem can easily be converted into an algorithm for the solution of the latter problem. This result bears on at least two important computational issues. First, we realize that a straightforward method that improves the known upper bound for tree-adjoining grammar parsing is hard to find. Second, we understand which features of the tree-adjoining grammar parsing problem are responsible for the claimed difficulty.
42 citations
30 Aug 1992
TL;DR: Graph grammars provide a useful formalism for describing structural manipulations of multidimensional data and are used most successfully in application areas other than pattern recognition.
Abstract: Graph grammars provide a useful formalism for describing structural manipulations of multidimensional data. The authors review briefly theoretical aspects of graph grammars, particularly of the embedding problem, and then summarize graph-grammar applications. Currently graph grammars are used most successfully in application areas other than pattern recognition. Widespread application of graph grammars to picture processing tasks will require research into problems of large-scale grammars, readability of grammars, and grammatical processing of uncertain data. >
42 citations
TL;DR: It is proved this model has greater generative capacity than the tiling systems of Giammarresi and Restivo and the grammars of Matz, another generalization of context-free string Grammars to 2D.
41 citations