String adjunct grammars: I. Local and distributed adjunction
作者： A.K. Joshi , S.R. Kosaraju , H.M. Yamada
DOI: 10.1016/S0019-9958(72)90051-4
关键词: Definite clause grammar 、 Context-free grammar 、 Artificial intelligence 、 Natural language processing 、 Tree-adjoining grammar 、 Context-sensitive grammar 、 Phrase structure grammar 、 c-command 、 Programming language 、 L-attributed grammar 、 Indexed grammar 、 Mathematics
摘要: In this paper [and in Joshi et al. (1972) which is a sequel to paper] new style of formal grammar called String Adjunct Grammars (AG) has been studied. The rules an AG have character essentially different from the “rewrite rule” Phrase Structure Grammar (PSG). Such study grammars styles great interest because each well suited for characterizing certain aspects natural language structure but inherent difficulty other aspects. Several subclasses AG's motivated by strong linguistic considerations Linguistic relevance these and suggested also discussed.
elsevier.com
sci-hub.se 参考文章(7)
Zellig Sabbettai Harris, Mathematical structures of language ,(1968)
A.K. Joshi, S.R. Kosaraju, H.M. Yamada, String adjunct grammars: II. Equational representation, null symbols, and linguistic relevance Information & Computation. ,vol. 21, pp. 235- 260 ,(1972) , 10.1016/S0019-9958(72)80005-6
Aravind K. Joshi, Properties of formal grammars with mixed types of rules and their linguistic relevance international conference on computational linguistics. pp. 1- 18 ,(1969) , 10.3115/990403.990450
Maurice Gross, Inherent ambiguity of minimal linear grammars Information and Control. ,vol. 7, pp. 366- 368 ,(1964) , 10.1016/S0019-9958(64)90422-X
Johnson M. Hart, An infinite hierarchy of linear local adjunct languages Information & Computation. ,vol. 23, pp. 245- 259 ,(1973) , 10.1016/S0019-9958(73)90725-0
Seymour Ginsburg, The mathematical theory of context free languages ,(1966)
Leon Sholom Levy, Generalized local adjunction and replacement in adjunct languages University of Pennsylvania. ,(1970)