Grammatical inference of graph grammars for syntactic pattern recognition

  • B. Bartsch-Spörl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 153)


This paper presents a new approach to the use of graph grammars for syntactic pattern recognition.

First an introduction concerning the representation of complex two or three-dimensional patterns with labelled nodes and edges is given.

Then follows the definition of a special class of graph grammars with rules producing chain- and star-structured subgraphs.

A constructive inference algorithm is developed which uses the knowledge contained in the actual grammar for the productions needed for the next sample pattern.

For the same class of graph grammars, a nondeterministic syntax analysis algorithm is described which analyzes new patterns pursuing the same strategy as the inference algorithm.

Some remarks about the possibilities of extending this approach to stochastic and/or programmed grammars are added.

Finally some examples from an implementation of the graph grammar inference and analysis system are given.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /1/.
    Fu, K.S.: Syntactic Methods in Pattern Recognition, Academic Press New York 1974Google Scholar
  2. /2/.
    Gonzalez, R.C.; Thomason, M.G.: Syntactic Pattern Recognition, Addison-Wesley Reading 1978Google Scholar
  3. /3/.
    Pavlidis, T.: Linear and Context-Free Graph Grammars, Journal of the ACM 19 (1972), 193–220Google Scholar
  4. /4/.
    Della Vigna, P.; Ghezzi, C.: Context-Free Graph Grammars, Information and Control 37 (1978), 207–233Google Scholar
  5. /5/.
    Nagl, M.: Formal Languages of Labelled Graphs, Computing 16 (1976), 113–137Google Scholar
  6. /6/.
    Fu, K.S.; Booth, T.L.: Grammatical Inference: Introduction and Survey — Part I and II, IEEE-Transactions on Systems, Man and Cybernetics, vol. SMC-5, 95–111 and 409–423Google Scholar
  7. /7/.
    Rosenkrantz, D.: Programmed Grammars — A New Device for Generating Formal Languages, J. Assoc. Comput. Mach. 10 (1969), 107–131Google Scholar
  8. /8/.
    Huang, T.; Fu, K.S.: Stochastic Syntactic Analysis for Programmed Grammars and Syntactic Pattern Recognition, Computer Graphics and Image Processing 1 (1972), 257–283Google Scholar
  9. /9/.
    Bley, H.: Vorverarbeitung und Segmentierung von Stromlaufplänen unter Verwendung von Bildgraphen, Reports of the IMMD, vol. 15, no. 6, University of Erlangen 1982Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • B. Bartsch-Spörl
    • 1
  1. 1.Softl ab GmbHMünchen 81

Personalised recommendations