{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T04:42:41Z","timestamp":1725424961507},"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\/s15-1031","type":"proceedings-article","created":{"date-parts":[[2015,12,15]],"date-time":"2015-12-15T19:22:31Z","timestamp":1450207351000},"page":"259-268","source":"Crossref","is-referenced-by-count":3,"title":["The complexity of finding the maximum spanning DAG and other restrictions for DAG parsing of natural language"],"prefix":"10.18653","author":[{"given":"Natalie","family":"Schluter","sequence":"first","affiliation":[]}],"member":"1643","event":{"name":"Proceedings of the Fourth Joint Conference on Lexical and Computational Semantics","start":{"date-parts":[[2015,6]]},"location":"Denver, Colorado","end":{"date-parts":[[2015,6]]}},"container-title":["Proceedings of the Fourth Joint Conference on Lexical and Computational Semantics"],"original-title":[],"deposited":{"date-parts":[[2015,12,15]],"date-time":"2015-12-15T19:22:39Z","timestamp":1450207359000},"score":1,"resource":{"primary":{"URL":"http:\/\/aclweb.org\/anthology\/S15-1031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"URL":"https:\/\/doi.org\/10.18653\/v1\/s15-1031","relation":{},"subject":[],"published":{"date-parts":[[2015]]}}}