{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:53:21Z","timestamp":1648576401917},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2012,11,1]]},"DOI":"10.1093\/comjnl\/bxs004","type":"journal-article","created":{"date-parts":[[2012,2,18]],"date-time":"2012-02-18T01:56:02Z","timestamp":1329530162000},"page":"1347-1356","source":"Crossref","is-referenced-by-count":0,"title":["The String-to-Dictionary Matching Problem"],"prefix":"10.1093","volume":"55","author":[{"given":"S. T.","family":"Klein","sequence":"first","affiliation":[]},{"given":"D.","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2012,2,17]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/55\/11\/1347\/1134851\/bxs004.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T02:30:46Z","timestamp":1503455446000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxs004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,17]]},"references-count":0,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2012,11,1]]},"published-print":{"date-parts":[[2012,11,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxs004","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,17]]}}}