{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:17:28Z","timestamp":1759940248520},"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":[[2015]]},"DOI":"10.18653\/v1\/d15-1288","type":"proceedings-article","created":{"date-parts":[[2015,12,15]],"date-time":"2015-12-15T16:53:04Z","timestamp":1450198384000},"page":"2409-2418","source":"Crossref","is-referenced-by-count":5,"title":["Compact, Efficient and Unlimited Capacity: Language Modeling with Compressed Suffix Trees"],"prefix":"10.18653","author":[{"given":"Ehsan","family":"Shareghi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Petri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gholamreza","family":"Haffari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trevor","family":"Cohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1643","event":{"name":"Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing","start":{"date-parts":[[2015,9]]},"location":"Lisbon, Portugal","end":{"date-parts":[[2015,9]]}},"container-title":["Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing"],"original-title":[],"deposited":{"date-parts":[[2015,12,15]],"date-time":"2015-12-15T16:53:58Z","timestamp":1450198438000},"score":1,"resource":{"primary":{"URL":"http:\/\/aclweb.org\/anthology\/D15-1288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"URL":"https:\/\/doi.org\/10.18653\/v1\/d15-1288","relation":{},"subject":[],"published":{"date-parts":[[2015]]}}}