Skip to main content
Log in

Sequential classification of strings generated by SCFG's

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

A sequential classification algorithm (SCA) for stochastic context-free languages is given. The algorithm is an extension of Earley's parsing algorithm for context-free languages. The SCA uses an optimum decision rule and a suboptimal stopping rule. The time bound is proportional ton 3 (n is the length of the string). A parametere* in the SCA allows an easy control over the probability of error. It is shown theoretically and experimentally that a considerable amount of processing time can be saved when using the SCA compared to the time required when using Earley's algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. C. Lee and K. S. Fu, “A stochastic syntax analysis procedure and its applications to pattern classification,”IEEE Trans, on Computers C 21 (July):660–667 (1972).

    Google Scholar 

  2. B. Moayer and K. S. Fu, “A syntactic approach to fingerprint pattern recognition,” inProc. First International Joint Conference on Pattern Recognition, Oct. 30–Nov. 1,1973, Washington, D.C.

  3. K. S. Fu, “On syntactic pattern recognition and stochastic languages” (Technical Report TR-EE 71-21, January 1971, Purdue University, Lafayette, Indiana), inFrontiers of Pattern Recognition, Ed. by S. Watanabe (Academic Press, 1972).

  4. A. V. Aho, Ed.,Currents in the Theory of Computing (Prentice-Hall, Englewood Cliffs, New Jersey, 1973).

    Google Scholar 

  5. J. Earley, “An efficient context-free parsing algorithm,”Commun. ACM 13 (February): 94–102 (1970).

    Google Scholar 

  6. T. L. Booth and R. A. Thompson, “Applying probability measures to abstract languages,”IEEE Trans, on Computers C 22 (May):442–450 (1973).

    Google Scholar 

  7. J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, Reading, Massachusetts, 1969).

    Google Scholar 

  8. E. Persoon and K. S. Fu, “Sequential decision procedures with prespecified error probabilities and their applications,” Technical Report TR-EE 74-30, Purdue University, Lafayette, Indiana, August 1974.

    Google Scholar 

  9. K. S. Fu and T. Huang, “Stochastic grammars and languages,”Int. J. Comput. Inf. Sci. 1(2):135 (1972).

    Google Scholar 

  10. H. C. Lee and K. S. Fu, “Stochastic linguistics for picture recognition,” Technical Report, TR-EE, 72-17, School of Electrical Engineering, Purdue University, Lafayette, Indiana, June 1972.

    Google Scholar 

  11. K. S. Fu,Syntactic Methods in Pattern Recognition (Academic Press, 1974).

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by the AFOSR Grant 74–2661.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Persoon, E., Fu, K.S. Sequential classification of strings generated by SCFG's. International Journal of Computer and Information Sciences 4, 205–217 (1975). https://doi.org/10.1007/BF01007759

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01007759

Key words

Navigation