Abstract
An algorithm for the inference of tree grammars from sample trees is presented. The procedure, which is based on the properties of self-embedding and regularity, produces a reduced tree grammar capable of generating all the samples used in the inference process as well as other trees similar in structure. The characteristics of the algorithm are illustrated by experimental results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. T. Tou and R. C. Gonzalez,Pattern Recognition Principles (Addison-Wesley, Reading, Massachusetts, 1974).
K. S. Fu and P. H. Swain, “On Syntactic Pattern Recognition,” inSoftware Engineering, J. T. Tou, ed. (Academic Press, New York, 1973).
R. C. Gonzalez, Syntactic pattern recognition–introduction and survey,Proc. NEC 27, 27–32 (1972).
K. S. Fu, Syntactic Methods in Pattern Recognition (Academic Press, New York, 1974).
J. L. Pfaltz and A. Rosenfeld, “Web Grammars,” inProceedings of the International Conference on Artificial Intelligence (Washington, D.C., May 1969), pp. 609–619.
J. Feder, Plex languages,Inf. Sci. (3), 225–241 (1971).
T. Pavlidis, Linear and context-free graph grammars,J. Assoc. Comput. Mach. 19(1), 11–22 (1972).
T. Pavlidis, Representation of figures by labeled graphs,Pattern Recognition 4(1), 5–17 (1972).
K. S. Fu and B. K. Bhargava, Tree systems for syntactic pattern recognition,IEEE Trans. Comput C-27(12), 1087–1099 (1973).
R. C. Gonzalez and M. G. Thomason, “Tree Grammars and their Application to Syntactic Pattern Recognition,” Technical Report TR-EE/CS-74-10, Electrical Engineering Department, University of Tennessee, Knoxville (1974).
R. C. Gonzalez and M. G. Thomason, “On the Inference of Tree Grammars for Syntactic Pattern Recognition,”Proc. International Conference on Systems, Man and Cybernetics (Dallas, Texas, 1974), pp. 311–315.
B. K. Bhargava and K. S. Fu, “Transformation and Inference of Tree Grammars,”Proc. International Conference on Systems, Man and Cybernetics (Dallas, Texas, 1974), pp. 330–333.
R. C. Gonzalez, M. G. Thomason, and J. J. Edwards, “Inference of Tree Grammars for Syntactic Pattern Recognition,” Technical Report TR-EE/CS-74-20, Electrical Engineering Department, University of Tennessee, Knoxville (1974).
D. E. Knuth,The Art of Computer Programming, Vol. 1 (Addison-Wesley, Reading, Massachusetts, 1969).
S. Gorn, “Explicit Definitions and Linguistic Dominoes,” inSystems and Computer Science, J. F. Hart and S. Takasu, eds. (University of Toronto Press, Toronto, 1967), pp. 77–115.
Author information
Authors and Affiliations
Additional information
Work supported by the Office of Naval Research, Arlington, Virginia, under contract N00014-71-A-0121-0005.
Rights and permissions
About this article
Cite this article
Gonzalez, R.C., Edwards, J.J. & Thomason, M.G. An algorithm for the inference of tree grammars. International Journal of Computer and Information Sciences 5, 145–164 (1976). https://doi.org/10.1007/BF00975630
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00975630