{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:11:24Z","timestamp":1648512684542},"reference-count":15,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":4303,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1996,12]]},"abstract":"<jats:p>A connection is made between the theory of ergodicity and the expected complexity of string searching. In particular, a substring search algorithm is introduced which, when applied to searching in text that has been produced by an appropriate stationary ergodic source, has an expected running time of <jats:italic>O((N\/m + m)logm)<\/jats:italic>, for a text string of length <jats:italic>N<\/jats:italic> and search string of length <jats:italic>m.<\/jats:italic> Similar expected complexity results have been obtained before, but the analysis is performed in a significantly more general framework, which models with greater accuracy the statistics of many types of strings, including natural language. The analysis also sheds light on the performance of the Boyer-Moore algorithm and the Sunday algorithm when applied to natural language.<\/jats:p>","DOI":"10.1017\/s0963548300002169","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:13:14Z","timestamp":1221217994000},"page":"415-427","source":"Crossref","is-referenced-by-count":0,"title":["Fast String Matching in Stationary Ergodic Sources"],"prefix":"10.1017","volume":"5","author":[{"given":"John","family":"Shawe-Taylor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S0963548300002169_ref003","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79184"},{"key":"S0963548300002169_ref013","volume-title":"Ergodic Theory and Information","author":"Billingsley","year":"1965"},{"key":"S0963548300002169_ref006","first-page":"75","volume-title":"Proc. Workshop in Algorithms and Data Structures. Lecture Notes in Computer Science 382","author":"Baeza-Yates","year":"1989"},{"key":"S0963548300002169_ref010","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"S0963548300002169_ref007","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380100608"},{"key":"S0963548300002169_ref009","doi-asserted-by":"publisher","DOI":"10.1137\/0208029"},{"key":"S0963548300002169_ref002","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380120106"},{"key":"S0963548300002169_ref015","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90138-6"},{"key":"S0963548300002169_ref001","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"S0963548300002169_ref012","volume-title":"Codes and Cryptography","author":"Welsh","year":"1988"},{"key":"S0963548300002169_ref004","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"S0963548300002169_ref014","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705908"},{"key":"S0963548300002169_ref005","doi-asserted-by":"publisher","DOI":"10.1137\/0209051"},{"key":"S0963548300002169_ref008","doi-asserted-by":"publisher","DOI":"10.1137\/0217041"},{"key":"S0963548300002169_ref011","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380240105"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548300002169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:44:22Z","timestamp":1557690262000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548300002169\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0963548300002169"],"URL":"https:\/\/doi.org\/10.1017\/s0963548300002169","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}