{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T11:11:54Z","timestamp":1726053114651},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030322359"},{"type":"electronic","value":"9783030322366"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32236-6_37","type":"book-chapter","created":{"date-parts":[[2019,9,29]],"date-time":"2019-09-29T19:23:57Z","timestamp":1569785037000},"page":"415-425","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Multi-pattern Matching Algorithm for Chinese-Hmong Mixed Strings"],"prefix":"10.1007","author":[{"given":"Shun-Ping","family":"He","sequence":"first","affiliation":[]},{"given":"Li-Ping","family":"Mo","sequence":"additional","affiliation":[]},{"given":"Di-Wen","family":"Kang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,30]]},"reference":[{"issue":"6","key":"37_CR1","first-page":"130","volume":"29","author":"ZB Yang","year":"2008","unstructured":"Yang, Z.B., Luo, H.Y.: On the folk coinage of characters of the Miao people in Xiangxi area. J. Jishou Univ. (Soc. Sci. Edn.) 29(6), 130\u2013134 (2008)","journal-title":"J. Jishou Univ. (Soc. Sci. Edn.)"},{"issue":"4","key":"37_CR2","first-page":"150","volume":"39","author":"L Zeng","year":"2018","unstructured":"Zeng, L., Mo, L.P., Liu, B.Y., et al.: Extended Horspool algorithm and its application in square Hmong string pattern matching. J. Jishou Univ. (Nat. Sci. Edn.) 39(4), 150\u2013156 (2018)","journal-title":"J. Jishou Univ. (Nat. Sci. Edn.)"},{"issue":"6","key":"37_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"issue":"4","key":"37_CR4","first-page":"30","volume":"30","author":"GH Han","year":"2013","unstructured":"Han, G.H., Zeng, C.: Theoretical research of KMP algorithm. Microelectron. Comput. 30(4), 30\u201333 (2013)","journal-title":"Microelectron. Comput."},{"issue":"10","key":"37_CR5","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"issue":"6","key":"37_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/S0097539793245829","volume":"24","author":"R Cole","year":"1995","unstructured":"Cole, R., Hariharan, R., Paterson, M., Zwick, U.: Tighter lower\u00a0bounds\u00a0on the\u00a0exact\u00a0complexity\u00a0of string\u00a0matching. SIAM J. Comput. 24(6), 30\u201345 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"37_CR7","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S009753979324694X","volume":"26","author":"R Cole","year":"1997","unstructured":"Cole, R., Hariharan, R.: Tighter upper bounds on the exact complexity of string matching. SIAM J. Comput. 26(3), 803\u2013856 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"37_CR8","first-page":"183","volume":"35","author":"X Zhao","year":"2017","unstructured":"Zhao, X., He, L.F., Wang, X., et al.: An efficient pattern matching algorithm for string searching. J. Shanxi Univ. Sci. Technol. (Nat. Sci. Edn.) 35(1), 183\u2013187 (2017)","journal-title":"J. Shanxi Univ. Sci. Technol. (Nat. Sci. Edn.)"},{"issue":"4","key":"37_CR9","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1137\/0209051","volume":"9","author":"LJ Guibas","year":"1980","unstructured":"Guibas, L.J., Odlyzko, A.M.: A new proof of the linearity of the Boyer-Moore string searching algorithm. SIAM J. Comput. 9(4), 672\u2013682 (1980)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"37_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/79173.79184","volume":"33","author":"DM Sunday","year":"1990","unstructured":"Sunday, D.M.: A very fast substring search algorithm. Commun. ACM 33(8), 132\u2013142 (1990)","journal-title":"Commun. ACM"},{"issue":"1","key":"37_CR11","first-page":"37","volume":"32","author":"WX Wang","year":"2017","unstructured":"Wang, W.X.: Research and improvement of the BM pattern matching algorithm. J. Shanxi Normal Univ. (Nat. Sci. Edn.) 32(1), 37\u201339 (2017)","journal-title":"J. Shanxi Normal Univ. (Nat. Sci. Edn.)"},{"issue":"6","key":"37_CR12","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"RN Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Softw.-Pract. Exper. 10(6), 501\u2013506 (1980)","journal-title":"Softw.-Pract. Exper."}],"container-title":["Lecture Notes in Computer Science","Natural Language Processing and Chinese Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32236-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,29]],"date-time":"2019-09-29T19:48:41Z","timestamp":1569786521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32236-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030322359","9783030322366"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32236-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NLPCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CCF International Conference on Natural Language Processing and Chinese Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dunhuang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nlpcc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tcci.ccf.org.cn\/conference\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"softconf","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"492","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}