Abstract
Stochastic syntax-directed translation schemata describe both the syntactic structure and the probability distribution of stochastic mappings between contextfree languages. The relationship between stochastic syntax-directed translation schemata and stochastic grammars and automata are presented by proving that a stochastic pushdown transducer can be constructed to define the same translations as a simple schema, and that the simple schema are characterized by stochastic contextfree grammars. Asymptotic properties of linear schemata are established by the theory of Markov chains. Since stochastic translations contain both input and output strings, their information content can be described. Equations are developed for both the information content and the rate of stochastic translations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation, and Compiling, Vols. I and II (Prentice-Hall, Englewood Cliffs, N.J., 1972).
T. L. Booth,Sequential Machines and Automata Theory (Wiley, New York, 1967).
T. L. Booth, “Estimation, prediction and smoothing in discrete parameter systems,”IEEE Trans. Comput. C-19(12):1193–1203 (December 1970).
T. L. Booth and R. A. Thompson, “Applying probability measures to abstract languages,”IEEE Trans. Comput. C-22(5):442–450 (May 1973).
J. W. Carlyle, “On the external probability structure of finite-state channels,”Inf. Control. 7:385–397 (1964).
K. L. Chung,Markov Chains with Stationary Probabilities (Springer-Verlag, New York, 1967).
W. Feller,An Introduction to Probability Theory and Its Applications, Vol. 1 (Wiley, New York, 1957).
K-S Fu,Syntactic Methods in Pattern Recognition (Academic Press, New York, 1974).
K. S. Fu and T. Huang, “Stochastic grammars and languages,”Int. J. Comput. Inf. Sci. 1(2):135–170 (1972).
S. E. Gelenbe, “A unified approach to the evaluation of a class of replacement algorithms,”IEEE Trans. Comput. C-22(6):611–618 (June 1973).
U. Grenander, “Syntax-Controlled Probabilities,” Division of Applied Mathematics, Brown University, Providence, R.I. (December 1967).
T. E. Harris,The Theory of Branching Processes (Springer-Verlag, Berlin, 1963).
J. G. Kemeny and J. L. Snell,Finite Markov Chains (Van Nostrand, Princeton, N. J., 1960).
W. F. King, III, “Analysis of Paging Algorithms,” IBM Research Report, RC 3288 (1971).
H. C. Lee and K. S. Fu, “Stochastic Linguistics for Picture Recognition,” TREE 72-17. Department of Electrical Engineering, Purdue University (1972).
F. J. Maryanski, “Probabilistic Translation Schema,”Proceedings of the Conference on Information Science and Systems (April 1976), p. 513.
F. J. Maryanski and T. L. Booth, “Estimation Automata for Stochastic Sequential Machines,”Proceedings of the Conference on Information Science and Systems (March 1973), pp. 268–272.
C. D. Meyer, Jr., “The role of the group generalized inverse in the theory of finite markov chains,”SIAM Rev. 17(3):443–464 (1975).
E. Parzen,Stochastic Processes (Holden-Day, San Francisco, 1962).
D. Sankoff, “Branching processes with terminal types: Application to context-free grammars,”J. Appl. Probab. 8:233–240 (1971).
S. Soule, “Entropies of probabilistic grammars,”Inf. Control 25(1):57–74 (May 1974).
M. G. Thomason, “Error Correction by Stochastic Syntax-Directed Translation Schemata,”Proceedings of the Conference on Information Science and Systems (April 1976), 438.
M. G. Thomason, “Stochastic syntax-directed translation schemata for correction of errors in context-free languages,”IEEE Trans. Comput. C-24(12):1211–1216 (1976).
K. S. Trivedi, “Prepaging and applications to array algorithms,”IEEE Trans. Comput. C-25(9):915–921 (1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Maryanski, F.J., Thomason, M.G. Properties of stochastic syntax-directed translation schemata. International Journal of Computer and Information Sciences 8, 89–110 (1979). https://doi.org/10.1007/BF00989665
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00989665