{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:31:45Z","timestamp":1754109105265},"publisher-location":"Berlin, Heidelberg","reference-count":0,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354673"},{"type":"electronic","value":"9783540354697"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780885_29","type":"book-chapter","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T12:13:38Z","timestamp":1165839218000},"page":"288-289","source":"Crossref","is-referenced-by-count":1,"title":["A New Algorithm for Unsupervised Induction of Concatenative Morphology"],"prefix":"10.1007","author":[{"given":"Harald","family":"Hammarstr\u00f6m","sequence":"first","affiliation":[]}],"member":"297","container-title":["Lecture Notes in Computer Science","Finite-State Methods and Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780885_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T03:08:33Z","timestamp":1505876913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780885_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354673","9783540354697"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/11780885_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}