This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Error-Correcting Tree Automata for Syntactic Pattern Recognition
November 1978 (vol. 27 no. 11)
pp. 1040-1053
null Shin-Yee Lu, Department of Electrical and Computer Engineering, Syracuse University
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.
Index Terms:
syntactic pattern recognition, Character recognition, error transformation, pattern recognition
Citation:
null Shin-Yee Lu, null King-Sun Fu, "Error-Correcting Tree Automata for Syntactic Pattern Recognition," IEEE Transactions on Computers, vol. 27, no. 11, pp. 1040-1053, Nov. 1978, doi:10.1109/TC.1978.1674993
Usage of this product signifies your acceptance of the Terms of Use.