Tree Systems for Syntactic Pattern Recognition

An approach of representing patterns by trees rather than by strings is described. A review of tree systems that include tree grammars, transformations, and mappings on trees and tree automata is briefly presented. The tree system is then applied to the problem of syntactic pattern recognition. Tree grammars are used for pattern description, and tree automata are used for classification. Illustrative examples include the application of the tree system to the classification of bubble chamber events and some English characters.

[1]  Alan C. Shaw,et al.  PICTURE GRAPHS, GRAMMARS, AND PARSING**This work was supported in part by The National Science Foundation grant GJ-108. , 1972 .

[2]  Russell A. Kirsch,et al.  Computer Interpretation of English Text and Picture Patterns , 1964, IEEE Trans. Electron. Comput..

[3]  J. R. Büchi.  Regular Canonical Systems , 1964 .

[4]  Alan C. Shaw,et al.  A Formal Picture Description Scheme as a Basis for Picture Processing Systems , 1969, Inf. Control..

[5]  Philip H. Swain,et al.  Stochastic programmed grammars for syntactic pattern recognition , 1972, Pattern Recognition.

[6]  Theodosios Pavlidis,et al.  Linear and Context-Free Graph Grammars , 1972, JACM.

[7]  Azriel Rosenfeld,et al.  Web Grammars , 1969, IJCAI.

[8]  Seymour Ginsburg,et al.  A Mathematical Model of Transformational Grammars , 1969, Inf. Control..

[9]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[10]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[11]  Saul Corn,et al.  Explicit Definitions and Linguistic Dominoes , 1967 .

[12]  James W. Thatcher,et al.  Transformations and translations from the point of view of generalized finite automata theory , 1969, STOC.

[13]  Stephen B. Gray,et al.  Local Properties of Binary Images in Two Dimensions , 1971, IEEE Transactions on Computers.

[14]  John L. Pfaltz,et al.  Web grammars and picture description , 1972, Comput. Graph. Image Process..

[15]  Robert McNaughton,et al.  Parenthesis Grammars , 1967, JACM.

[16]  Azriel Rosenfeld,et al.  Array Automata and Array Grammars , 1971, IFIP Congress.

[17]  William C. Rounds,et al.  Context-free grammars on trees , 1969, STOC.

[18]  Kendall Preston,et al.  Feature Extraction by Golay Hexagonal Pattern Transforms , 1971, IEEE Transactions on Computers.

[19]  Frank Beck.  The Special Features of POLLY: How They Are Used for Automatic Scanning , 1971, IEEE Transactions on Computers.

[20]  P. H. Swain,et al.  On Syntactic Pattern Recognition , 1971 .

[21]  John Mylopoulos.  On the Relation of Graph Grammars and Graph Automata , 1972, SWAT.

[22]  Norihiro Abe,et al.  Web Grammars and Several Graphs , 1973, J. Comput. Syst. Sci..

[23]  Michael F. Dacey,et al.  The syntax of a triangle and some other figures , 1970, Pattern Recognit..

[24]  K. S. Fu,et al.  On syntactic pattern recognition and stochastic languages , 1972 .

[25]  Ugo Montanari,et al.  Separable Graphs, Planar Graphs and Web Grammars , 1970, Inf. Control..

[26]  Jerome Feder,et al.  Plex languages , 1971, Inf. Sci..

[27]  Howard S. White.  Finding Events in a Sea of Bubbles , 1971, IEEE Transactions on Computers.

[28]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..