{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:03:15Z","timestamp":1729630995430,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1109\/apsipa.2015.7415358","type":"proceedings-article","created":{"date-parts":[[2016,3,28]],"date-time":"2016-03-28T19:11:46Z","timestamp":1459192306000},"page":"47-53","source":"Crossref","is-referenced-by-count":2,"title":["A robust spoken Q&A system with scarce in-domain resources"],"prefix":"10.1109","author":[{"given":"Luis Fernando","family":"D'Haro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seokhwan","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael E.","family":"Banchs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03524-6_15"},{"key":"ref11","article-title":"Recognition Confidence Scoring for Use in Speech Understanding Systems","author":"hazen","year":"2000","journal-title":"Proc ISCA Tutorial and Research Workshop ASR2000"},{"key":"ref12","article-title":"One Billion Word Benchmark for Measuring Progress in Statistical Language Modeling","author":"chelba","year":"2013","journal-title":"eprint arXiv 1312 3005"},{"key":"ref13","first-page":"187","article-title":"KenLM: Faster and smaller language model queries","author":"heafield","year":"2011","journal-title":"Proceedings of the Sixth Workshop on Statistical Machine Translation"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.2985","article-title":"A survey of paraphrasing and textual entailment methods","author":"androutsopoulos","year":"2010","journal-title":"Journal of Artificial Intelligence Research"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/coli_a_00002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7287.001.0001","article-title":"WordNet: An Electronic Lexical Database","author":"fellbaum","year":"1998"},{"key":"ref18","article-title":"Efficient “Estimation of Word Representations in Vector Space","author":"mikolov","year":"2013","journal-title":"Proceedings of Workshop at ICLR"},{"key":"ref19","article-title":"Distributed Representations of Words and Phrases and their Compositionality","author":"mikolov","year":"2013","journal-title":"Proceedings of NIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639735"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-011-9222-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19291-8_22"},{"key":"ref5","first-page":"37","article-title":"IRIS: a chat-oriented dialogue system based on the vector space model","author":"banchs","year":"2012","journal-title":"Proceedings of the ACL 2012 System Demonstrations Association for Computational Linguistics"},{"key":"ref8","article-title":"FaNT - Filtering and Noise Adding Tool","author":"hirsch","year":"0","journal-title":"Tech Rep"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2009.2016394"},{"key":"ref2","first-page":"14","article-title":"Feature-based similarity models for top-n recommendation of new items","author":"elbadrawy","year":"2013","journal-title":"Tech Rep"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.07.021"},{"key":"ref9","first-page":"394","article-title":"Which ASR should I choose for my dialogue system","author":"morbini","year":"2013","journal-title":"Proc 11th Annu SigDial Meeting Discourse Dialogue"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n^5\/2 algorithm for maximum matchings in bipartite graphs","volume":"2 4","author":"hoperoft","year":"1973","journal-title":"SIAM Journal on Computing"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3115\/1220835.1220893"}],"event":{"name":"2015 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA)","start":{"date-parts":[[2015,12,16]]},"location":"Hong Kong","end":{"date-parts":[[2015,12,19]]}},"container-title":["2015 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7406495\/7415286\/07415358.pdf?arnumber=7415358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T01:31:57Z","timestamp":1567733517000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7415358\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/apsipa.2015.7415358","relation":{},"subject":[],"published":{"date-parts":[[2015,12]]}}}