A CONTROL LANGUAGE FOR TRANSFORMATIONAL GRAMMAR,

reportActive / Technical Report | Accession Number: AD0692687 | Need Help?

Abstract:

Various orders of application of transformations have been considered in transformational grammar, ranging from unorder to cyclical orders involving notions of lowest sentence and of numerical indices on depth of embedding. The general theory of transformational grammar does not yet offer a uniform set of traffic rules which are accepted by most linguists. Thus, in designing a model of transformational grammar, it seems advisable to allow the specification of the order and point of application of transformations to be a proper part of the grammar. In this paper we present a simple control language designed to be used by linguists for this specification. Author

Author(s):
Friedman, Joyce ; Pollack, Bary W.
Author Organization(s):
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Supplementary Note:
Report on Stanford Computational Linguistics Project.
Pagination:
0055

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
CS-112
Contract/Grant Number(s):
F19628-67-C-0035
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*COMPUTATIONAL LINGUISTICS, TRANSFORMATIONAL GRAMMARS), (*TRANSFORMATIONAL GRAMMARS, COMPUTER PROGRAMMING), PHRASE STRUCTURE GRAMMARS, SYNTAX, ALGORITHMS
Field(s)/Group(s):
Linguistics, Computer Programming and Software
Report Date:
1968 Aug 01