Accession Number:

AD0743217

Title:

Stochastic Syntactic Analysis and Syntactic Pattern Recognition,

Descriptive Note:

Corporate Author:

PURDUE UNIV LAFAYETTE IND SCHOOL OF ELECTRICAL ENGINEERING

Personal Author(s):

Report Date:

1972-02-01

Pagination or Media Count:

115.0

Abstract:

Stochastic syntactic analysis algorithms for the class of stochastic context-free programmed languages are proposed and their application to pattern classification demonstrated. The area of grammatical inference is briefly reviewed and the possible extension to the inference of stochastic grammars is also studied. A stochastic grammar is formed by assigning a probability to each production associated with a grammar which is a formal system used conveniently to specify a language. The problem of deciding whether or not a stochastic grammar is consistent is called the consistency problem of stochastic languages. It is not yet known whether or not the consistency problem is decidable for stochastic context-sensitive grammars, stochastic programmed grammars and stochastic indexed grammars. Two types of stochastic syntatic analysis algorithms are proposed for stochastic context-free programmed languages. Author

Subject Categories:

  • Linguistics
  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE