The String-to-String Correction Problem
Journal of the ACM (JACM)
A Document Storage Method Based on Polarized Distance
Journal of the ACM (JACM)
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Formal languages and their relation to automata
Formal languages and their relation to automata
IEEE Transactions on Computers
A Stochastic Syntax Analysis Procedure and Its Application to Pattern Classification
IEEE Transactions on Computers
Linguistic methods in picture processing: a survey
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Error detection in formal languages
Journal of Computer and System Sciences
Error-Correcting Parsers for Formal Languages
IEEE Transactions on Computers
Error-Correcting Tree Automata for Syntactic Pattern Recognition
IEEE Transactions on Computers
Pattern Recognition and Image Processing
IEEE Transactions on Computers
Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns
IEEE Transactions on Computers
Language Correction Using Probabilistic Grammars
IEEE Transactions on Computers
| Hi-index | 15.00 |
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.