Efficient multi-attribute pattern matching
This paper describes an efficient multi-attribute pattern matching machine to locate all occurrences of any of a finite number of a sequence of rule structures in a series of input structures. The matching operation of the proposed machine is similar to the method of Aho-Corasick or the method of re...
Gespeichert in:
| Veröffentlicht in: | International journal of computer mathematics 1998-01, Vol.66 (1-2), p.21-38 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 38 |
|---|---|
| container_issue | 1-2 |
| container_start_page | 21 |
| container_title | International journal of computer mathematics |
| container_volume | 66 |
| creator | Ando, Kazuaki Mizobuchi, Shoji Shishibori, Masami Aoe, Jun-Ichi |
| description | This paper describes an efficient multi-attribute pattern matching machine to locate all occurrences of any of a finite number of a sequence of rule structures in a series of input structures. The matching operation of the proposed machine is similar to the method of Aho-Corasick or the method of retrieval using a trie, however, the proposed machine has the following distinctive features: (1) The proposed machine enables us to match set representations containing multiple attributes; (2) It enables us to match separate components; (3) It enables us to match a rule consisting of an exclusive set. In this paper, their features are described in detail. Moreover, the pattern matching algorithm is evaluated by the theoretical observations and the experimental observations that are supported by the simulation results for a variety of rules for document processing as text proofreading, text reduction, and examining a relation between sentences. |
| doi_str_mv | 10.1080/00207169808804622 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1298734</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>27507879</sourcerecordid><originalsourceid>FETCH-LOGICAL-c404t-a574f412aaed676a57f1ec3f531bebcb33a49aad5477bdf81cab28662e1f830c3</originalsourceid><addsrcrecordid>eNqFkE1LAzEQhoMoWKs_wFsP4kFYnXxskgUvUuoHCF70vMxmE43sR02yaP-9W1rxUMTTzDDP8zIMIacULilouAJgoKgsNGgNQjK2RyYUWJEBk_k-maz32QjAITmK8R0AdKHkhFwsnPPG2y7N2qFJPsOUgq-GZGfLsbWhm7WYzJvvXo_JgcMm2pNtnZKX28Xz_D57fLp7mN88ZkaASBnmSjhBGaKtpZLj6Kg13OWcVrYyFecoCsQ6F0pVtdPUYMW0lMxSpzkYPiXnm9xl6D8GG1PZ-mhs02Bn-yGWTOWgtCpGkG5AE_oYg3XlMvgWw6qkUK6_Uu58ZXTOtuEYDTYuYGd8_BVZoRUXI6Y2mO9cH1r87ENTlwlXTR9-nJ3wMn2l0bz-1-R_3_cN75GGgg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27507879</pqid></control><display><type>article</type><title>Efficient multi-attribute pattern matching</title><source>Taylor & Francis Journals Complete</source><creator>Ando, Kazuaki ; Mizobuchi, Shoji ; Shishibori, Masami ; Aoe, Jun-Ichi</creator><creatorcontrib>Ando, Kazuaki ; Mizobuchi, Shoji ; Shishibori, Masami ; Aoe, Jun-Ichi</creatorcontrib><description>This paper describes an efficient multi-attribute pattern matching machine to locate all occurrences of any of a finite number of a sequence of rule structures in a series of input structures. The matching operation of the proposed machine is similar to the method of Aho-Corasick or the method of retrieval using a trie, however, the proposed machine has the following distinctive features: (1) The proposed machine enables us to match set representations containing multiple attributes; (2) It enables us to match separate components; (3) It enables us to match a rule consisting of an exclusive set. In this paper, their features are described in detail. Moreover, the pattern matching algorithm is evaluated by the theoretical observations and the experimental observations that are supported by the simulation results for a variety of rules for document processing as text proofreading, text reduction, and examining a relation between sentences.</description><identifier>ISSN: 0020-7160</identifier><identifier>EISSN: 1029-0265</identifier><identifier>DOI: 10.1080/00207169808804622</identifier><identifier>CODEN: IJCMAT</identifier><language>eng</language><publisher>Abingdon: Gordon and Breach Science Publishers</publisher><subject>1.2.7 ; 1.2.8 ; Algorithms ; Applied sciences ; Computer science; control theory; systems ; Control Methods and Search ; Exact sciences and technology ; exclusive set ; F.2.2 ; H.3.3 ; Information retrieval ; Information retrieval. Graph ; Information Search and Retrieval ; Language theory and syntactical analysis ; Mathematical programming ; met representation ; multi-attribute pattern matching ; Natural Language Processing ; Nonnumerical Algorithms and Problems ; Operational research and scientific management ; Operational research. Management science ; Problem Solving ; separate components ; string pattern matching ; Theoretical computing</subject><ispartof>International journal of computer mathematics, 1998-01, Vol.66 (1-2), p.21-38</ispartof><rights>Copyright Taylor & Francis Group, LLC 1998</rights><rights>2000 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c404t-a574f412aaed676a57f1ec3f531bebcb33a49aad5477bdf81cab28662e1f830c3</citedby><cites>FETCH-LOGICAL-c404t-a574f412aaed676a57f1ec3f531bebcb33a49aad5477bdf81cab28662e1f830c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/00207169808804622$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/00207169808804622$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,780,784,4024,27923,27924,27925,59647,60436</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1298734$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Ando, Kazuaki</creatorcontrib><creatorcontrib>Mizobuchi, Shoji</creatorcontrib><creatorcontrib>Shishibori, Masami</creatorcontrib><creatorcontrib>Aoe, Jun-Ichi</creatorcontrib><title>Efficient multi-attribute pattern matching</title><title>International journal of computer mathematics</title><description>This paper describes an efficient multi-attribute pattern matching machine to locate all occurrences of any of a finite number of a sequence of rule structures in a series of input structures. The matching operation of the proposed machine is similar to the method of Aho-Corasick or the method of retrieval using a trie, however, the proposed machine has the following distinctive features: (1) The proposed machine enables us to match set representations containing multiple attributes; (2) It enables us to match separate components; (3) It enables us to match a rule consisting of an exclusive set. In this paper, their features are described in detail. Moreover, the pattern matching algorithm is evaluated by the theoretical observations and the experimental observations that are supported by the simulation results for a variety of rules for document processing as text proofreading, text reduction, and examining a relation between sentences.</description><subject>1.2.7</subject><subject>1.2.8</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Control Methods and Search</subject><subject>Exact sciences and technology</subject><subject>exclusive set</subject><subject>F.2.2</subject><subject>H.3.3</subject><subject>Information retrieval</subject><subject>Information retrieval. Graph</subject><subject>Information Search and Retrieval</subject><subject>Language theory and syntactical analysis</subject><subject>Mathematical programming</subject><subject>met representation</subject><subject>multi-attribute pattern matching</subject><subject>Natural Language Processing</subject><subject>Nonnumerical Algorithms and Problems</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Problem Solving</subject><subject>separate components</subject><subject>string pattern matching</subject><subject>Theoretical computing</subject><issn>0020-7160</issn><issn>1029-0265</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><recordid>eNqFkE1LAzEQhoMoWKs_wFsP4kFYnXxskgUvUuoHCF70vMxmE43sR02yaP-9W1rxUMTTzDDP8zIMIacULilouAJgoKgsNGgNQjK2RyYUWJEBk_k-maz32QjAITmK8R0AdKHkhFwsnPPG2y7N2qFJPsOUgq-GZGfLsbWhm7WYzJvvXo_JgcMm2pNtnZKX28Xz_D57fLp7mN88ZkaASBnmSjhBGaKtpZLj6Kg13OWcVrYyFecoCsQ6F0pVtdPUYMW0lMxSpzkYPiXnm9xl6D8GG1PZ-mhs02Bn-yGWTOWgtCpGkG5AE_oYg3XlMvgWw6qkUK6_Uu58ZXTOtuEYDTYuYGd8_BVZoRUXI6Y2mO9cH1r87ENTlwlXTR9-nJ3wMn2l0bz-1-R_3_cN75GGgg</recordid><startdate>19980101</startdate><enddate>19980101</enddate><creator>Ando, Kazuaki</creator><creator>Mizobuchi, Shoji</creator><creator>Shishibori, Masami</creator><creator>Aoe, Jun-Ichi</creator><general>Gordon and Breach Science Publishers</general><general>Taylor and Francis</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19980101</creationdate><title>Efficient multi-attribute pattern matching</title><author>Ando, Kazuaki ; Mizobuchi, Shoji ; Shishibori, Masami ; Aoe, Jun-Ichi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c404t-a574f412aaed676a57f1ec3f531bebcb33a49aad5477bdf81cab28662e1f830c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>1.2.7</topic><topic>1.2.8</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Control Methods and Search</topic><topic>Exact sciences and technology</topic><topic>exclusive set</topic><topic>F.2.2</topic><topic>H.3.3</topic><topic>Information retrieval</topic><topic>Information retrieval. Graph</topic><topic>Information Search and Retrieval</topic><topic>Language theory and syntactical analysis</topic><topic>Mathematical programming</topic><topic>met representation</topic><topic>multi-attribute pattern matching</topic><topic>Natural Language Processing</topic><topic>Nonnumerical Algorithms and Problems</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Problem Solving</topic><topic>separate components</topic><topic>string pattern matching</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ando, Kazuaki</creatorcontrib><creatorcontrib>Mizobuchi, Shoji</creatorcontrib><creatorcontrib>Shishibori, Masami</creatorcontrib><creatorcontrib>Aoe, Jun-Ichi</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ando, Kazuaki</au><au>Mizobuchi, Shoji</au><au>Shishibori, Masami</au><au>Aoe, Jun-Ichi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient multi-attribute pattern matching</atitle><jtitle>International journal of computer mathematics</jtitle><date>1998-01-01</date><risdate>1998</risdate><volume>66</volume><issue>1-2</issue><spage>21</spage><epage>38</epage><pages>21-38</pages><issn>0020-7160</issn><eissn>1029-0265</eissn><coden>IJCMAT</coden><abstract>This paper describes an efficient multi-attribute pattern matching machine to locate all occurrences of any of a finite number of a sequence of rule structures in a series of input structures. The matching operation of the proposed machine is similar to the method of Aho-Corasick or the method of retrieval using a trie, however, the proposed machine has the following distinctive features: (1) The proposed machine enables us to match set representations containing multiple attributes; (2) It enables us to match separate components; (3) It enables us to match a rule consisting of an exclusive set. In this paper, their features are described in detail. Moreover, the pattern matching algorithm is evaluated by the theoretical observations and the experimental observations that are supported by the simulation results for a variety of rules for document processing as text proofreading, text reduction, and examining a relation between sentences.</abstract><cop>Abingdon</cop><pub>Gordon and Breach Science Publishers</pub><doi>10.1080/00207169808804622</doi><tpages>18</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-7160 |
| ispartof | International journal of computer mathematics, 1998-01, Vol.66 (1-2), p.21-38 |
| issn | 0020-7160 1029-0265 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1298734 |
| source | Taylor & Francis Journals Complete |
| subjects | 1.2.7 1.2.8 Algorithms Applied sciences Computer science control theory systems Control Methods and Search Exact sciences and technology exclusive set F.2.2 H.3.3 Information retrieval Information retrieval. Graph Information Search and Retrieval Language theory and syntactical analysis Mathematical programming met representation multi-attribute pattern matching Natural Language Processing Nonnumerical Algorithms and Problems Operational research and scientific management Operational research. Management science Problem Solving separate components string pattern matching Theoretical computing |
| title | Efficient multi-attribute pattern matching |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T02%3A11%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20multi-attribute%20pattern%20matching&rft.jtitle=International%20journal%20of%20computer%20mathematics&rft.au=Ando,%20Kazuaki&rft.date=1998-01-01&rft.volume=66&rft.issue=1-2&rft.spage=21&rft.epage=38&rft.pages=21-38&rft.issn=0020-7160&rft.eissn=1029-0265&rft.coden=IJCMAT&rft_id=info:doi/10.1080/00207169808804622&rft_dat=%3Cproquest_pasca%3E27507879%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=27507879&rft_id=info:pmid/&rfr_iscdi=true |