The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1978 vol.27)
pp: 1040-1053
null Shin-Yee Lu , Department of Electrical and Computer Engineering, Syracuse University
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.
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, November 1978, doi:10.1109/TC.1978.1674993
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool