String adjunct grammars
- 1 October 1969
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02724847,p. 245-262
- https://doi.org/10.1109/swat.1969.23
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.Keywords
This publication has 12 references indexed in Scilit:
- String adjunct grammarsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1969
- Indexed Grammars—An Extension of Context-Free GrammarsJournal of the ACM, 1968
- Transformational decompositionPublished by Association for Computational Linguistics (ACL) ,1967
- Transformational TheoryLanguage, 1965
- Derivatives of Regular ExpressionsJournal of the ACM, 1964
- Inherent ambiguity of minimal linear grammarsInformation and Control, 1964
- Classes of languages and linear-bounded automataInformation and Control, 1964
- Delayed-logic and finite-state machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1961
- Regular Expressions and State Graphs for AutomataIEEE Transactions on Electronic Computers, 1960
- Three models for the description of languageIEEE Transactions on Information Theory, 1956