{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T19:07:39Z","timestamp":1648840059277},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Literary and Linguistic Computing"],"DOI":"10.1093\/llc\/fqi030","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T00:13:47Z","timestamp":1122682427000},"page":"353-362","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Strategies for Accurate Transcription"],"prefix":"10.1093","volume":"21","author":[{"given":"M.","family":"Spencer","sequence":"first","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2005,8,5]]},"container-title":["Literary and Linguistic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/dsh\/article-pdf\/21\/3\/353\/3779908\/fqi030.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T20:23:11Z","timestamp":1503519791000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/dsh\/article-lookup\/doi\/10.1093\/llc\/fqi030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8,5]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2005,8,5]]}},"URL":"https:\/\/doi.org\/10.1093\/llc\/fqi030","relation":{},"ISSN":["0268-1145","1477-4615"],"issn-type":[{"value":"0268-1145","type":"print"},{"value":"1477-4615","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,8,5]]}}}