DocumentCode
1136157
Title
Error-Correcting Tree Automata for Syntactic Pattern Recognition
Author
Lu, Shin-Yee ; Fu, King-Sun
Author_Institution
Department of Electrical and Computer Engineering, Syracuse University
Issue
11
fYear
1978
Firstpage
1040
Lastpage
1053
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.
Keywords
Character recognition; error transformation; pattern recognition; syntactic pattern recognition; Automata; Character recognition; Classification tree analysis; Costs; Fingerprint recognition; Pattern analysis; Pattern recognition; Production; Stochastic processes; Tree graphs; Character recognition; error transformation; pattern recognition; syntactic pattern recognition;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1978.1674993
Filename
1674993
Link To Document