Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-15T10:15:45.305Z Has data issue: false hasContentIssue false
  • English
  • Français

Relational networks

Published online by Cambridge University Press:  26 October 2017

Peter A. Reich
Peter A. Reich*
Affiliation:
University of Toronto
Get access Rights & Permissions [Opens in a new window]

Extract

Many contemporary linguists describe their data in terms of a system of rules which state that one string of symbols is to be rewritten as another string of symbols, perhaps with the condition that this only occur when the symbols occur in a particular context. When the linguist wants to use the grammar to produce a particular utterance, he starts with an initial symbol and, one at a time in linear sequence, applies or attempts to apply the rules to the string of symbols he is building up. After applying all of the rules, or perhaps a subset of them, he may have to reapply the rules of a subset of them again and again until no further changes can be made to the string. If at the end of this process the string consists solely of terminal symbols, he has produced a grammatical utterance. Basically such systems consist of symbols and a few operations on these symbols, including match, copy, concatenate, and replace. This system grew out of a union of the item-and-process approach to linguistics with automata theory, an area of mathematics related to the understanding of computers.

Type
Research Article
Information
Canadian Journal of Linguistics/Revue canadienne de linguistique , Volume 15 , Issue 2 , Spring 1970 , pp. 95 - 110
Copyright
Copyright © Canadian Linguistic Association 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Algeo, John, “On defining a stratum,” Emory University Quarterly, 1970, 23, 263–96.Google Scholar
Bach, Emmon, An introduction to transformational grammars. New York: Holt, Rinehart & Winston, 1964.Google Scholar
Chomsky, Noam, Syntactic structures. The Hague: Mouton, 1957.Google Scholar
Chomsky, Noam, Aspects of the theory of syntax. The Hague: Mouton, 1965.Google Scholar
Chomsky, Noam, “The formal nature of language,” in Lenneberg, Eric, Biological foundations of language. New York: Wiley, 1967, 399–442.Google Scholar
Fleming, Ilah, “Stratificational theory: an annotated bibliography,” Journal of English Linguistics, 1969, 3, 37–65.Google Scholar
Gleason, H. A. Jr., “The organization of language,” in Stuart, C.I.J.M (ed), Report of the fifteenth round table meeting on linguistics and language studies. Monograph series on languages and linguistics 17. Washington, D.C.: Georgetown University Press, 1964, 75–95.Google Scholar
Lamb, Sidney M., Outline of stratificational grammar. Washington, D.C.: Georgetown University Press, 1966a.Google Scholar
Lamb, Sidney M., “Prolegomena to a theory of phonology,” Language, 1966b 42 537–73.Google Scholar
Markov, A. A., Theory of algorithms. Works of the V. A. Steklov Mathematical Institute 42. Moscow, USSR: Academy of Sciences. 1954. (Translated by Schoor-Kon, J. J. and staff, Jerusalem, Israel Program for Scientific Translation. Washington, D.C: Office of Technical Services, U.S. Department of Commerce OTS 60-5 1085, 1961.)Google Scholar
Postal, Paul M., Aspects of phonological theory. New York: Harper & Row 1968.Google Scholar
Reich, Peter A., “Symbols, relations, and structural complexity,” Linguistic automation project report. New Haven, Conn.: Yale University, 1968.Google Scholar
Reich, Peter A., “The finiteness of natural language,” Language, 1969, 45, 831–43.Google Scholar
Reich, Peter A., “A relational network model of language behavior,” Ph.D. dissertation, University of Michigan. Ann Arbor, Mich.: University Microfilms 1970a.Google Scholar
Reich, Peter A. “The English auxiliaries: a relational network description,” Canadian Journal of Linguistics, 1970b, 16: 1 (in press).CrossRefGoogle Scholar
Schützenberger, M. P., and Chomsky, Noam, “The algebraic theory of context-free languages,” in Braffort, P. & Hirshberg, D. (eds), Computer programming and formal systems. Amsterdam: North Holland, 1963, 118–61.Google Scholar
Weizenbaum, Joseph, “Symmetric list processor,” Communications of the ACM, 1963, 6, 524–43.Google Scholar
Yngve, Victor H., “A model and an hypothesis for language structure,” Proceedings of the American Philosophical Society, 1960, 444–66. (Bobbs-Merrill Reprint, Language 101).Google Scholar