Proceedings

An Automatically Compilable Recognition Network For Structured Patterns

Download BibTeX Cite

Proceedings of the Fourth International Joint Conference on Artificial Intelligence. Learning Debugging And Automatic Programming. Pages 246-251.

© 1975 International Joint Conferences on Artificial Intelligence

Abstract

A new method for efficient recoanilion of aeneral relational structures is described and compared with existing methods. Patterns to be recognized are defined by templates consisting of a set of predicate calculus relations. Productions are representable by associating actions with templates. A network for recognizing occurrences of any of the template patterns in data may be automatically compiled. The compiled network is economical in the sense that conjunctive products (subsets) of relations common to several templates are represented in and computed by the network only once. The recognition network operates in a bottom-up fashion, in which all possibilities for pattern matches are evaluated simultaneously. The distribution of the recognition process throughout the network means that H can readily be decomposed into par aile I processes for use on a multiprocessor machine. The method is expected to be especially useful in errorful domains (!!.:&:, vision, speech) where par.llel treatment of alternative hypotheses is desired. The network is illustrated with an example from the current syntax and semantics module in the Hearsay II speech understandina system.

  1. Barrow, H.G., Ambler, A.P., & Burst~lll, R.M. Some techniques for recognising structures In pictures. In S. Watanabe (Ed.), Frontiers 2i pattern . recognition. New York: Academic Press, 1972.
  2. Colby, K.M., Faught, B., & P;~rkison, R.C. Pattern-matching rules for the recognition of natural langu1ge dialogue expressions. Memo AIM-234. Stanford: Stanford Artificial Intelligence Laboratory, Stanford University, 1974.
  3. Feldman, J.A., & Rovnar, F. An Algol-based associative language. Communications Qi the ACM, 1969, !l, 439- 449.
  4. Frost, M. The news service system. Operating Note SAILON 72-2. Stanford: Stanford Artificial Intelligence Laboratory, Stanford University, 1974.
  5. Hayes-Roth, F. An optimal network representation and other mechanisms for the recognition of structured events. Proceedings Qi the Second International Joint Conf.erence on Pattern Recognition, 1974. 251
  6. Hayes-Roth, F. The representation ol structured events and efficient procedures for their recognition. Pittsburgh: Department of Computer Science, Carnegie-Mellon University, 1974.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards