Error-Correcting Parsers for Formal Languages

Authors:
E. Tanaka; King-Sun Fu
Affiliations:
Department of Information Engineering, Faculty of Engineering, Utsunomiya University;-
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 5
Cited 1

An error-correcting parse algorithm

Communications of the ACM
Errors in Regular Languages

IEEE Transactions on Computers
Stochastic Syntactic Decoding for Pattern Classification

IEEE Transactions on Computers
A Method for the Correction of Garbled Words Based on the Levenshtein Metric

IEEE Transactions on Computers
Error detection in formal languages

Journal of Computer and System Sciences

Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata

Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper describes error-correcting parsers for context-free and context-sensitive languages with substitution, insertion and deletion errors. Furthermore, it is shown that the ability of the proposed parsers can be expressed in terms of the weighted Levenshtein metric.