{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:37:58Z","timestamp":1725489478808},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441298"},{"type":"electronic","value":"9783540461548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46154-x_41","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:30:38Z","timestamp":1187267438000},"page":"301-308","source":"Crossref","is-referenced-by-count":4,"title":["Phoneme Lattice Based A* Search Algorithm for Speech Recognition"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Nocera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georges","family":"Linares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Massoni\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lo\u00efc","family":"Lefort","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"unstructured":"R. De Mori, \u201cSpoken dialogues with computers,\u201d 1997.","key":"41_CR1"},{"unstructured":"J. Pearl, \u201cHeuristics: Intelligent search strategies for computer problem solving,\u201d 1984.","key":"41_CR2"},{"issue":"2","key":"41_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/csla.1993.1007","volume":"7","author":"H.-W. Hon","year":"1993","unstructured":"H.-W. Hon M.-Y. Hwang K.-F. Lee R. Rosenfeld X. Huang F. Alleva, \u201cThe SPHINX II speech recognition system: An overview,\u201d Computer Speech and Language, Vol. 7, No. 2, pp. 137\u2013148, 1993.","journal-title":"Computer Speech and Language"},{"doi-asserted-by":"crossref","unstructured":"D.B. Paul, \u201cAlgorithms for an optimal A* search and linearizing the search in the stack decoder,\u201d ICASSP 91, pp. 693\u2013696, 1991.","key":"41_CR4","DOI":"10.1109\/ICASSP.1991.150434"},{"unstructured":"J. Dolmazon F. Bimbot G. Adda J. Caerou J. Zeiliger M. Adda-Decker, \u201cPremi\u00e8re campagne AUPELF d\u2019\u00e9valuation des syst\u00e8mes de Dict\u00e9e Vocale,\u201d \u201cRessources et \u00e9valuation en ing\u00e9nierie des langues,\u201d, pp. 279\u2013307, 2000.","key":"41_CR5"},{"doi-asserted-by":"crossref","unstructured":"Matrouf, O. Bellot, P. Nocera, J.-F. Bonastre, G. Linares, \u201cA posteriori and a priori transformations for speaker adaptation in large vocabulary speech recognition systems,\u201d EuroSpeech 2001, Aalborg.","key":"41_CR6","DOI":"10.21437\/Eurospeech.2001-323"}],"container-title":["Lecture Notes in Computer Science","Text, Speech and Dialogue"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46154-X_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T20:24:29Z","timestamp":1684009469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46154-X_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441298","9783540461548"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-46154-x_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}