{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:00:39Z","timestamp":1725703239221},"publisher-location":"ISCA","reference-count":0,"publisher":"ISCA","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.21437\/eurospeech.1995-207","type":"proceedings-article","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T16:17:41Z","timestamp":1659370661000},"page":"1071-1074","source":"Crossref","is-referenced-by-count":0,"title":["A comparison of two exact algorithms for finding the n-best sentence hypotheses in continuous speech recognition"],"prefix":"10.21437","author":[{"given":"V. M.","family":"Jimenez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Marzal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Monn\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"8866","published-online":{"date-parts":[[1995,9,18]]},"event":{"name":"4th European Conference on Speech Communication and Technology (Eurospeech 1995)","acronym":"eurospeech_1995"},"container-title":["4th European Conference on Speech Communication and Technology (Eurospeech 1995)"],"original-title":[],"deposited":{"date-parts":[[2024,1,16]],"date-time":"2024-01-16T09:26:59Z","timestamp":1705397219000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.isca-archive.org\/eurospeech_1995\/jimenez95_eurospeech.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9,18]]},"references-count":0,"URL":"https:\/\/doi.org\/10.21437\/eurospeech.1995-207","relation":{},"subject":[],"published":{"date-parts":[[1995,9,18]]}}}