SOME COMPUTATIONAL PROPERTIES OF TREE ADJOINING GRAMMERS
暂无分享,去创建一个
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.
[1] Carl Jesse Pollard,et al. Generalized phrase structure grammars, head grammars, and natural language , 1984 .
[2] Aravind K. Joshi,et al. Constraints on Structural Descriptions: Local Transformations , 1977, SIAM J. Comput..
[3] Anthony S. Kroch,et al. The Linguistic Relevance of Tree Adjoining Grammar , 1985 .