The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
TAL recognition in O(M(n2)) time
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A probabilistic model for sequence alignment with context-sensitive indels
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Hi-index | 0.00 |
Tree Adjoining Grammar (TAG) is a formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Joshi, Levy, and Takahashi 1975] and by [Joshi, 1983]. A detailed investigation of the linguistic relevance of TAG's has been carried out in [Kroch and Joshi, 1985]. In this paper, we will describe some new results for TAG's, especially in the following areas: (1) parsing complexity of TAG's, (2) some closure results for TAG's, and (3) the relationship to Head grammars.