Stochastic Syntactic Decoding for Pattern Classification
- 1 June 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-24 (6), 662-667
- https://doi.org/10.1109/t-c.1975.224278
Abstract
A model of noise deformation of the substitution type is adopted for linguistic patterns generated by formal grammars. The maximum-likelihood criterion and the minimum-distance criterion are proposed for the classification of noisy strings described by context-free grammars. Classification algorithms based on a modified Cocke-Younger-Kasami parsing scheme are presented.Keywords
This publication has 9 references indexed in Scilit:
- Maximum-likelihood syntactic decodingIEEE Transactions on Information Theory, 1975
- Stochastic Syntactic Decoding for Pattern ClassificationIEEE Transactions on Computers, 1975
- Errors in Regular LanguagesIEEE Transactions on Computers, 1974
- A Document Storage Method Based on Polarized DistanceJournal of the ACM, 1974
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Finite fuzzy automata, regular fuzzy languages, and pattern recognitionPattern Recognition, 1973
- A Minimum Distance Error-Correcting Parser for Context-Free LanguagesSIAM Journal on Computing, 1972
- A Stochastic Syntax Analysis Procedure and Its Application to Pattern ClassificationIEEE Transactions on Computers, 1972
- Error detection in formal languagesJournal of Computer and System Sciences, 1970