{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:19:30Z","timestamp":1648930770821},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3886,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00185-8","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T14:53:32Z","timestamp":1042815212000},"page":"525-546","source":"Crossref","is-referenced-by-count":6,"title":["Discovering characteristic expressions in literary works"],"prefix":"10.1016","volume":"292","author":[{"given":"Masayuki","family":"Takeda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoko","family":"Fukuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Nanri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00185-8_BIB1","doi-asserted-by":"crossref","unstructured":"H. Arimura, Text data mining with optimized pattern discovery, in: Proc. 17th Workshop on Machine Intelligence, Cambridge, 2000.","DOI":"10.1007\/3-540-45452-7_2"},{"key":"10.1016\/S0304-3975(02)00185-8_BIB2","doi-asserted-by":"crossref","unstructured":"A. Blumer, J. Blumer, D. Haussler, R. Mcconnell, A. Ehrenfeucht, Complete inverted files for efficient text retrieval and analysis, J. ACM 34(3) (1987) 578\u2013595, previous version in: STOC\u201984.","DOI":"10.1145\/28869.28873"},{"key":"10.1016\/S0304-3975(02)00185-8_BIB3","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/S0304-3975(02)00185-8_BIB4","series-title":"A Probabilistic Theory of Pattern Recognition","author":"Devroye","year":"1997"},{"key":"10.1016\/S0304-3975(02)00185-8_BIB5","series-title":"G Advances in Knowledge Discovery and Data Mining","first-page":"1","article-title":"From data mining to knowledge discovery: an overview","author":"Fayyad","year":"1996"},{"key":"10.1016\/S0304-3975(02)00185-8_BIB6","unstructured":"T. Fukuda, Tametada-sh\u016b revisited, in: Proc. 46th Symp. on Waka Literature, 2000."},{"key":"10.1016\/S0304-3975(02)00185-8_BIB7","unstructured":"T. Fukuda, \u201cas if it were in darkness\/my parental heart\/is blind and lost in \u2026\u201d\u2014Kanesuke's poem revisited, 2001, submitted for publication."},{"key":"10.1016\/S0304-3975(02)00185-8_BIB8","series-title":"Combinatorial Algorithms on Words","first-page":"1","article-title":"Open problems in stringology","volume":"Vol. 12","author":"Galil","year":"1985"},{"key":"10.1016\/S0304-3975(02)00185-8_BIB9","unstructured":"M. Kondo, Studies on classical Japanese literature based on string analysis using n-gram statistics, Technical Report, Chiba University, March 2000 (in Japanese)."},{"key":"10.1016\/S0304-3975(02)00185-8_BIB10","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1002\/asi.5090110403","article-title":"Keyword-in-context index for technical literature (KWIC index)","volume":"11","author":"Luhn","year":"1960","journal-title":"Am. Doc."},{"key":"10.1016\/S0304-3975(02)00185-8_BIB11","doi-asserted-by":"crossref","unstructured":"S. Morishita, On classification and regression, in: Proc. First Int. Conf. on Discovery Science, Lecture Notes in Artificial Intelligence, Vol. 1532, 1998, pp. 49\u201359.","DOI":"10.1007\/3-540-49292-5_4"},{"issue":"3","key":"10.1016\/S0304-3975(02)00185-8_BIB12","first-page":"774","article-title":"On a quantitative analysis of auxiliary verbs used in Genji Monogatari","volume":"40","author":"Murakami","year":"1999","journal-title":"Trans. Process. Soc. Jpn."},{"issue":"1","key":"10.1016\/S0304-3975(02)00185-8_BIB13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF03037568","article-title":"Efficient discovery of optimal word-association patterns in large databases","volume":"18","author":"Shimozono","year":"2000","journal-title":"New Gener. Comput."},{"key":"10.1016\/S0304-3975(02)00185-8_BIB14","doi-asserted-by":"crossref","unstructured":"M. Takeda, T. Fukuda, I. Nanri, M. Yamasaki, K. Tamari, Discovering instances of poetic allusion from anthologies of classical Japanese poems, Theoret. Comput. Sci. (this Vol.) (2003).","DOI":"10.1016\/S0304-3975(02)00184-6"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001858?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001858?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T01:24:22Z","timestamp":1583976262000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502001858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502001858"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00185-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}