A method of pattern recognition using rewriting rules

Authors:
Akira Kurematsu;Manabu Takeda;Seiichi Inoue
Affiliations:
Research Laboratory, Kokusai Denshin Denwa Co., Ltd., Tokyo, Japan;Research Laboratory, Kokusai Denshin Denwa Co., Ltd., Tokyo, Japan;Research Laboratory, Kokusai Denshin Denwa Co., Ltd., Tokyo, Japan
Venue:
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Year:
1971

Citing 2
Cited 0

Syntax-directed interpretation of classes of pictures

Communications of the ACM
Pattern recognition studies in the biomedical sciences

AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method of applying rewriting rules to the recognition of patterns, structure of which are sequentially connected and can be expressed as symbol strings. Rewriting rules, which play the part of a recognizer, are formulated in a hierarchical structure. Rule 1 normalizes the length of string and extracts properties, rule 2 transforms the deformed string in a context dependent way and rule 3 determines the category. A procedure for producing rules from given sample patterns based on the similarity between the symbols and a procedure for modifying the rules when input patterns are added are described. Experimental results of the recognition of Japanese spoken digits to illustrate the method are exhibited.