{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:14:57Z","timestamp":1753521297140,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,5,23]],"date-time":"2011-05-23T00:00:00Z","timestamp":1306108800000},"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":[],"published-print":{"date-parts":[[2011,5,23]]},"DOI":"10.1145\/1987856.1987868","type":"proceedings-article","created":{"date-parts":[[2011,5,24]],"date-time":"2011-05-24T13:04:30Z","timestamp":1306242270000},"page":"50-53","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Software verification and validation research laboratory (SVVRL) of the University of Kentucky"],"prefix":"10.1145","author":[{"given":"Jane Huffman","family":"Hayes","sequence":"first","affiliation":[{"name":"University of Kentucky, Lexington, KY, USA"}]},{"given":"Hakim","family":"Sultanov","sequence":"additional","affiliation":[{"name":"University of Kentucky, Lexington, KY, USA"}]},{"given":"Wei-Keat","family":"Kong","sequence":"additional","affiliation":[{"name":"University of Kentucky, Lexington, KY, USA"}]},{"given":"Wenbin","family":"Li","sequence":"additional","affiliation":[{"name":"University of Kentucky, Lexington, KY, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,5,23]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11334-007-0024-1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1394399"},{"key":"e_1_3_2_1_5_1","unstructured":"Porter M. F. 1997. An algorithm for suffix stripping. Readings in information retrieval. Morgan Kaufmann Publishers Inc. 313--316   Porter M. F. 1997. An algorithm for suffix stripping. Readings in information retrieval. Morgan Kaufmann Publishers Inc. 313--316"},{"key":"e_1_3_2_1_6_1","unstructured":"Google Language API Family http:\/\/code.google.com\/apis\/language\/.  Google Language API Family http:\/\/code.google.com\/apis\/language\/."}],"event":{"name":"ICSE11: International Conference on Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"],"location":"Waikiki, Honolulu HI USA","acronym":"ICSE11"},"container-title":["Proceedings of the 6th International Workshop on Traceability in Emerging Forms of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1987856.1987868","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1987856.1987868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:24Z","timestamp":1750244784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1987856.1987868"}},"subtitle":["traceability challenge 2011: language translation"],"short-title":[],"issued":{"date-parts":[[2011,5,23]]},"references-count":5,"alternative-id":["10.1145\/1987856.1987868","10.1145\/1987856"],"URL":"https:\/\/doi.org\/10.1145\/1987856.1987868","relation":{},"subject":[],"published":{"date-parts":[[2011,5,23]]},"assertion":[{"value":"2011-05-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}