{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:05:49Z","timestamp":1760709949994},"publisher-location":"Stroudsburg, PA, USA","reference-count":0,"publisher":"Association for Computational Linguistics","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.18653\/v1\/d18-1406","type":"proceedings-article","created":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T20:01:17Z","timestamp":1561838477000},"page":"3708-3718","source":"Crossref","is-referenced-by-count":3,"title":["CaLcs: Continuously Approximating Longest Common Subsequence for Sequence Level Optimization"],"prefix":"10.18653","author":[{"given":"Semih","family":"Yavuz","sequence":"first","affiliation":[]},{"given":"Chung-Cheng","family":"Chiu","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Yonghui","family":"Wu","sequence":"additional","affiliation":[]}],"member":"1643","event":{"name":"Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing","start":{"date-parts":[[2018,10]]},"location":"Brussels, Belgium","end":{"date-parts":[[2018,11]]}},"container-title":["Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing"],"original-title":[],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T20:03:52Z","timestamp":1561838632000},"score":1,"resource":{"primary":{"URL":"http:\/\/aclweb.org\/anthology\/D18-1406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":0,"URL":"https:\/\/doi.org\/10.18653\/v1\/d18-1406","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}