Error-Correcting Tree Automata for Syntactic Pattern Recognition

Authors:
Shin-Yee Lu; King-Sun Fu
Affiliations:
Department of Electrical and Computer Engineering, Syracuse University;-
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 9
Cited 4

Linear and Context-Free Graph Grammars

Journal of the ACM (JACM)
Syntax-directed least-errors analysis for context-free languages: a practical approach

Communications of the ACM
Spelling correction in systems programs

Communications of the ACM
Syntactic Recognition of Imperfectly Specified Patterns

IEEE Transactions on Computers
Stochastic Syntactic Decoding for Pattern Classification

IEEE Transactions on Computers
Tree Systems for Syntactic Pattern Recognition

IEEE Transactions on Computers
Web grammars

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences
Tree acceptors and some of their applications

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
Local similarity between quotiented ordered trees

Journal of Discrete Algorithms
Recent Developments in Pattern Recognition

IEEE Transactions on Computers
On all-substrings alignment problems

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	14.98

Visualization

Abstract

The syntax errors on trees are defined in terms of five types of error transformations, namely, substitution, stretch, split, branch, and deletion. The distance between two trees is the least cost sequence of error transformations needed to transform one to the other. Based on this definition, a class of error-correcting tree automata (ECTA) is proposed. The operation of ECTA is illustrated by a character recognition example.