{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:35:34Z","timestamp":1648892134065},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p> This paper describes a weighted finite-state transducer composition algorithm that generalizes the concept of the composition filter and presents various filters that process epsilon transitions, look-ahead along paths, and push forward labels along epsilon paths. These filters, either individually or in combination, make it possible to compose some transducers much more efficiently in time and space than otherwise possible. We present examples of this drawn, in part, from demanding speech-processing applications. The generalized composition algorithm and many of these filters have been included in Open-Fst, an open-source weighted transducer library. <\/jats:p>","DOI":"10.1142\/s0129054111009033","type":"journal-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T07:46:00Z","timestamp":1326181560000},"page":"1781-1795","source":"Crossref","is-referenced-by-count":2,"title":["A FILTER-BASED ALGORITHM FOR EFFICIENT COMPOSITION OF FINITE-STATE TRANSDUCERS"],"prefix":"10.1142","volume":"22","author":[{"given":"CYRIL","family":"ALLAUZEN","sequence":"first","affiliation":[{"name":"Google Research, 76 Ninth Avenue, New York, NY 10011, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHAEL","family":"RILEY","sequence":"additional","affiliation":[{"name":"Google Research, 76 Ninth Avenue, New York, NY 10011, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JOHAN","family":"SCHALKWYK","sequence":"additional","affiliation":[{"name":"Google Research, 76 Ninth Avenue, New York, NY 10011, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,6]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008477"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/TSA.2005.860838"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00241-7"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00435-8"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00078-X"},{"key":"rf13","first-page":"321","volume":"7","author":"Mohri Mehryar","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-49127-9_28"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111009033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:13:10Z","timestamp":1565115190000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111009033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":8,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2012,4,6]]},"published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1142\/S0129054111009033"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111009033","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}