{"id":12939,"date":"2021-11-30T19:20:45","date_gmt":"2021-12-01T00:20:45","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12939"},"modified":"2026-06-02T14:59:25","modified_gmt":"2026-06-02T18:59:25","slug":"tr-97-09-designing-syntactic-pattern-classifiers-using-vector-quantization-and-parametric-string-editing","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1997\/tr-97-09-designing-syntactic-pattern-classifiers-using-vector-quantization-and-parametric-string-editing\/","title":{"rendered":"TR-97-09: Designing Syntactic Pattern Classifiers Using Vector Quantization and Parametric String Editing"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n TR-97-09: Designing Syntactic Pattern Classifiers Using Vector Quantization and Parametric String Editing\n <\/h1>\n \n \n <\/header>\n\n <\/div>\n\n <\/div>\n\n <\/div>\n<\/section>\n\n

Carleton University
\nTechnical Report<\/a> TR-97-09
\nMay 1997<\/p>\n\n\n\n

TR-97-09: Designing Syntactic Pattern Classifiers Using Vector Quantization and Parametric String Editing<\/h2>\n\n\n\n
\n
\n
\n
\n
\n
\n
\n
B. John Oommen & R.K.S. Loke<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n

We consider a fundamental problem in Syntactic Pattern Recognition (PR) in which we are required to recognize a string from its noisy version. We assume that the system has a dictionary which is a collection of all the ideal representations of the objects in question. When a noisy sample has to be processed, the system compares it with every element in the dictionary based on a nearest-neighbor philosophy. This is typically achieved using three standard edit operations -substitution, insertion and deletion. To accomplish this, one usually assigns a distance for the elementary symbol operations, d(., .), and the inter-pattern distance, D(., .), is computed as a function of these symbol edit distances. In this paper we consider the assignment of the inter\u00adsymbol distances in terms of the novel and interesting assignments -the parametric distances – recently introduced by Bunke et al. [4]. We show how the classifier can be trained to get the optimal parametric distance using vector quantization in the meta-space, and report classification results after such a training process. In all our experiments, the training was typically achieved in a very few iterations. The subsequent classification accuracy we obtained using this single\u00adparameter scheme was 96.13 %. The power of the scheme is obvious if we compare it to 96.67%, which is the accuracy of the scheme which uses the complete array of inter-symbol distances derived from a knowledge of all the confusion probabilities.<\/p>\n\n\n\n

TR-97-09.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Carleton University Technical Report TR-97-09 May 1997 TR-97-09: Designing Syntactic Pattern Classifiers Using Vector Quantization and Parametric String Editing B. John Oommen & R.K.S. Loke Abstract We consider a fundamental problem in Syntactic Pattern Recognition (PR) in which we are required to recognize a string from its noisy version. We assume that the system has […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":12157,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-12939","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12939","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12939"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12939\/revisions"}],"predecessor-version":[{"id":12941,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12939\/revisions\/12941"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12157"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12939"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12939"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}