{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:27:07Z","timestamp":1752460027272},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[1996,12]]},"abstract":"<jats:p>The full paper explores the possibility of using Subsequential \nTransducers (SST), a \nfinite state model, in limited domain translation tasks, both for text \nand speech input. \nA distinctive advantage of SSTs is that they can be efficiently learned\n from sets of \ninput-output examples by means of OSTIA, the Onward Subsequential Transducer \nInference Algorithm (Oncina <jats:italic>et al<\/jats:italic>. 1993). In this work a \ntechnique is proposed to \nincrease the performance of OSTIA by reducing the asynchrony between the\n input \nand output sentences, the use of error correcting parsing to increase \nthe robustness of the models is explored, and an integrated architecture\n for \nspeech input translation by means of SSTs is described.<\/jats:p>","DOI":"10.1017\/s1351324997001617","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:30:22Z","timestamp":1027762222000},"page":"351-354","source":"Crossref","is-referenced-by-count":5,"title":["Text and speech translation by means of \nsubsequential transducers"],"prefix":"10.1017","volume":"2","author":[{"given":"J. M.","family":"VILAR","sequence":"first","affiliation":[]},{"given":"V. M.","family":"JIM\u00c9NEZ","sequence":"additional","affiliation":[]},{"given":"J. C.","family":"AMENGUAL","sequence":"additional","affiliation":[]},{"given":"A.","family":"CASTELLANOS","sequence":"additional","affiliation":[]},{"given":"D.","family":"LLORENS","sequence":"additional","affiliation":[]},{"given":"E.","family":"VIDAL","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[1996,12,1]]},"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324997001617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T15:47:38Z","timestamp":1557676058000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324997001617\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S1351324997001617"],"URL":"https:\/\/doi.org\/10.1017\/s1351324997001617","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}