EFFICIENT MULTIATTRIBUTE PATTERN-MATCHING

This paper describes an efficient multi-attribute pattern matching mac hine to locate all occurrences of any of a finite number of a sequence of rule structures in a series of input structures. The matching oper ation of the proposed machine is similar to the method of Aho-Corasick or the method of retrieval using a trie, however, the proposed machin e has the following distinctive features: (1) The proposed machine ena bles us to match set representations containing multiple attributes; ( 2) It enables us to match separate components; (3) It enables us to ma tch a rule consisting of an exclusive set. In this paper, their featur es are described in detail. Moreover, the pattern matching algorithm i s evaluated by the theoretical observations and the experimental obser vations that are supported by the simulation results for a variety of rules for document processing as text proofreading, text reduction, an d examining a relation between sentences.