{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:11:24Z","timestamp":1761621084037,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p>A novel graph-based language-independent stemming algorithm suitable for information retrieval is proposed in this article. The main features of the algorithm are retrieval effectiveness, generality, and computational efficiency. We test our approach on seven languages (using collections from the TREC, CLEF, and FIRE evaluation platforms) of varying morphological complexity. Significant performance improvement over plain word-based retrieval, three other language-independent morphological normalizers, as well as rule-based stemmers is demonstrated.<\/jats:p>","DOI":"10.1145\/2037661.2037664","type":"journal-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T19:05:23Z","timestamp":1323198323000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["GRAS"],"prefix":"10.1145","volume":"29","author":[{"given":"Jiaul H.","family":"Paik","sequence":"first","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}]},{"given":"Mandar","family":"Mitra","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}]},{"given":"Swapan K.","family":"Parui","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}]},{"given":"Kalervo","family":"J\u00e4rvelin","sequence":"additional","affiliation":[{"name":"University of Tampere, Tampere, Finland"}]}],"member":"320","published-online":{"date-parts":[[2011,12,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582416"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2004.04.006"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2009.06.001"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1838745.1838748"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/945546.945548"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1162\/089120101750300490"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199101)42:1<7::AID-ASI2>3.0.CO;2-P"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199601)47:1%3C70::AID-ASI7%3E3.3.CO;2-Q"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1108\/00220410910937615"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/160688.160718"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85760-0_6"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281485.1281489"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:INRT.0000009441.78971.be"},{"volume-title":"Proceedings of the Workshop of Cross-Language Evaluation Forum on Cross-Language Information Retrieval and Evaluation (Revised Papers). Springer-Verlag","author":"Oard D. W.","key":"e_1_2_1_14_1","unstructured":"Oard , D. W. , Levow , G.-A. , and Cabezas , C. I . 2001. Clef experiments at maryland: Statistical stemming and backoff translation . In Proceedings of the Workshop of Cross-Language Evaluation Forum on Cross-Language Information Retrieval and Evaluation (Revised Papers). Springer-Verlag , Berlin, U.K., 176--187. Oard, D. W., Levow, G.-A., and Cabezas, C. I. 2001. Clef experiments at maryland: Statistical stemming and backoff translation. In Proceedings of the Workshop of Cross-Language Evaluation Forum on Cross-Language Information Retrieval and Evaluation (Revised Papers). Springer-Verlag, Berlin, U.K., 176--187."},{"volume-title":"An Algorithm for Suffix Stripping. Morgan Kaufmann","author":"Porter M. F.","key":"e_1_2_1_15_1","unstructured":"Porter , M. F. 1997. An Algorithm for Suffix Stripping. Morgan Kaufmann , San Francisco, CA , 313--316. Porter, M. F. 1997. An Algorithm for Suffix Stripping. Morgan Kaufmann, San Francisco, CA, 313--316."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2007.01.022"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/267954.267957"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2037661.2037664","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2037661.2037664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:28Z","timestamp":1750240468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2037661.2037664"}},"subtitle":["An effective and efficient stemming algorithm for information retrieval"],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1145\/2037661.2037664"],"URL":"https:\/\/doi.org\/10.1145\/2037661.2037664","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"type":"print","value":"1046-8188"},{"type":"electronic","value":"1558-2868"}],"subject":[],"published":{"date-parts":[[2011,12]]},"assertion":[{"value":"2011-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}