The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1969)
Oct. 15, 1969 to Oct. 17, 1969
ISSN: 0272-4847
pp: 245-262
ABSTRACT
In this paper, we have introduced a new style of formal grammars called String Adjunct Grammars (AG). The rules in an AG have a considerably different formal character as compared to the 'rewrite rule' in a Phrase Structure Grammar (PSG). Such a study of formal grammars of different styles (i.e., formal character of rules) is of great interest because each style is well suited for characterizing certain aspects of natural language structure and is awkward for characterizing certain other aspects. Several subclasses of AG's motivated by strong linguistic considerations have been studied, comparing them with PSG's. Linguistic relevance of these grammars (and other gram mars suggested by this study) has been discussed at the end.
INDEX TERMS
CITATION
A. K. Joshi, S. R. Kosaraju, H. Yamada, "String adjunct grammars", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 245-262, 1969, doi:10.1109/SWAT.1969.23
99 ms
(Ver 3.3 (11022016))