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: An optimal parallel recognition/parsing algorithm is presented for languages generated by tree adjoining grammars (TAGs), a grammatical system for natural language.
Abstract: An optimal parallel recognition/parsing algorithm is presented for languages generated by tree adjoining grammars (TAGs), a grammatical system for natural language. TAGs are strictly more powerful than context-free grammars (CFGs), e.g., they can generate $\{a'' b'' c'' | n \geqq 0\}$, which is not context-free. However, serial parsing of TAGs is also slower, having time complexity $O(n^{6})$ for inputs of length n (as opposed to $O(n^{3})$ for CFGs). The parallel algorithm achieves optimal speedup: it runs in linear time on a five-dimensional array of $n^5$ processors. Moreover, the processors are finite-state; i.e., their function and size depends only on the underlying grammar and not on the length of the input.
17 citations
••
08 Jul 2009TL;DR: The results show some benefit of using meta-grammars in GE and re-emphasize the grammar's impact on GE's performance, which can adapt to the environment by altering the grammar.
Abstract: This paper is concerned with the challenge of learning solutions to problems. The method employed here is a grammar based heuristic, where domain knowledge is encoded in a generative grammar, while evolution drives the update of the population of solutions. Furthermore the method can adapt to the environment by altering the grammar. The implementation consists of the grammar-based Genetic Programming approach of Grammatical Evolution (GE). A number of different constructions of grammars and operators for manipulating the grammars and the evolutionary algorithm are investigated, as well as a meta-grammar GE which allows a more flexible grammar. The results show some benefit of using meta-grammars in GE and re-emphasize the grammar's impact on GE's performance.
17 citations
••
TL;DR: Equational representations of String Adjunct Grammars, LAG's with null symbols, and some special cases of LAGs are studied.
Abstract: In this paper, we continue the study of String Adjunct Grammars (AG) introduced in Joshi et al. (1972). In particular, equational representations of LAG's, LAG's with null symbols, and some special cases of LAG's are studied. Linguistic relevance of these grammars is also discussed in some detail.
17 citations
••
10 Aug 1998
TL;DR: The new algorithm is much simpler, being very close to traditional LR parsing for context-free grammars, and the construction of derived trees and the computation of features also become straightforward.
Abstract: We present a new LR algorithm for tree-adjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpler, being very close to traditional LR parsing for context-free grammars. The construction of derived trees and the computation of features also become straightforward.
17 citations
•
01 Oct 1984
17 citations