{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:02:39Z","timestamp":1725674559975},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709800"},{"type":"electronic","value":"9783540709817"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70981-7_41","type":"book-chapter","created":{"date-parts":[[2007,3,23]],"date-time":"2007-03-23T13:49:52Z","timestamp":1174657792000},"page":"367-374","source":"Crossref","is-referenced-by-count":3,"title":["Putting Successor Variety Stemming to Work"],"prefix":"10.1007","author":[{"given":"Benno","family":"Stein","sequence":"first","affiliation":[]},{"given":"Martin","family":"Potthast","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"ABDOU, S., RUCH, P. and SAVOY, J. (2005): Evaluation of Stemming, Query Expansion and Manual Indexing Approaches for the Genomic Task. In: Proc.TREC\u201905."},{"key":"41_CR2","unstructured":"BACCHIN, M., FERRO, N. and MELUCCI, M. (2002): Experiments to Evaluate a Statistical Stemming Algorithm. In: Proc. of CLEF\u201902."},{"key":"41_CR3","unstructured":"BORDAG, S. (2005): Unsupervised Knowledge-free Morpheme Boundary Detection. In: Proc. of RANLP\u201905."},{"issue":"3\u20134","key":"41_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/B:INRT.0000011208.60754.a1","volume":"7","author":"M. Braschler","year":"2004","unstructured":"BRASCHLER, M. and RIPPLINGER, B. (2004): How Effective is Stemming and Decompounding for German Text Retrieval? Information Retrieval, 7,3\u20134, 291\u2013316.","journal-title":"Information Retrieval"},{"key":"41_CR5","unstructured":"FRAKES, W.B. (1984): Term Conflation for Information Retrieval. In: Proc. SIGIR\u201984."},{"key":"41_CR6","volume-title":"Information Retrieval: Data Structures and Algorithms","author":"W.B. Frakes","year":"1992","unstructured":"FRAKES, W.B. and BAEZA-YATES, R. (1992): Information Retrieval: Data Structures and Algorithms. Prentice-Hall, Upper Saddle River."},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"GUSFIELD, D. (1997): Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press.","DOI":"10.1017\/CBO9780511574931"},{"issue":"1","key":"41_CR8","first-page":"7","volume":"42","author":"D. Harman","year":"1991","unstructured":"HARMAN, D. (1991): How Effective is Suffixing? J. of the ASIS&T., 42,1, 7\u201315.","journal-title":"J. of the ASIS&T."},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"KROVETZ, R. (1993): Viewing Morphology as an Inference Process. In: Proc. SIGIR\u201993.","DOI":"10.1145\/160688.160718"},{"issue":"1","key":"41_CR10","first-page":"23","volume":"11","author":"J.B. Lovins","year":"1968","unstructured":"LOVINS, J.B. (1968): Development of a Stemming Algorithm. Mechanical Translation and Computation Linguistics, 11,1, 23\u201331.","journal-title":"Mechanical Translation and Computation Linguistics"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"MAYFIELD, J. and MCNAMEE, P. (2003): Single n-gram Stemming. In: Proc. SIGIR\u201903.","DOI":"10.1145\/860435.860528"},{"issue":"4","key":"41_CR12","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"MORRISON, D.R. (1968): PATRICIA\u2014Practical Algorithm to Retrieve Information Coded in Alphanumeric. Journal of the ACM, 15,4, 514\u2013534.","journal-title":"Journal of the ACM"},{"issue":"3","key":"41_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/101306.101310","volume":"24","author":"C.D. Paice","year":"1990","unstructured":"PAICE, C.D. (1990): Another Stemmer. In: SIGIR Forum, 24,3, 56\u201361.","journal-title":"SIGIR Forum"},{"issue":"3","key":"41_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"M.F. Porter","year":"1980","unstructured":"PORTER, M.F. (1980): An Algorithm for Suffix Stripping. Program, 14,3, 130\u2013137.","journal-title":"Program"},{"key":"41_CR15","unstructured":"PORTER, M. (2001): Snowball. http:\/\/snowball.tartarus.org\/."},{"key":"41_CR16","unstructured":"ROSE, T.G., STEVENSON, M. and WHITEHEAD, M. (2002): The Reuters Corpus Volume 1-From Yesterday\u2019s News to Tomorrow\u2019s Language Resources. In: Proc. of LREC\u201902."},{"key":"41_CR17","unstructured":"STEIN, B., MEYER ZU EISSEN, S. and WISSBROCK, F. (2003): On Cluster Validity and the Information Need of Users. In: Proc. of AIA\u201903."},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"WEINER, P. (1973): Linear Pattern Matching Algorithm. In: Proc. of the 14th IEEE Symp. on Switching and Automata Theory.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Studies in Classification, Data Analysis, and Knowledge Organization","Advances in Data Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70981-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T06:58:21Z","timestamp":1550300301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70981-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709800","9783540709817"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70981-7_41","relation":{},"ISSN":["1431-8814","2198-3321"],"issn-type":[{"type":"print","value":"1431-8814"},{"type":"electronic","value":"2198-3321"}],"subject":[],"published":{"date-parts":[[2007]]}}}