{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T16:08:12Z","timestamp":1781021292171,"version":"3.54.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2018.2883738","type":"journal-article","created":{"date-parts":[[2018,12,25]],"date-time":"2018-12-25T19:36:37Z","timestamp":1545766597000},"page":"1736-1751","source":"Crossref","is-referenced-by-count":28,"title":["Machine Learning Based Optimized Pruning Approach for Decoding in Statistical Machine Translation"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3756-864X","authenticated-orcid":false,"given":"Debajyoty","family":"Banik","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Asif","family":"Ekbal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pushpak","family":"Bhattacharyya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"222","article-title":"An efficient language model using double-array structures","author":"yasuhara","year":"2013","journal-title":"Proc Conf Empirical Methods Natural Lang Process"},{"key":"ref38","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","author":"sutskever","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","author":"kunchukuttan","year":"2016","journal-title":"Faster decoding for subword level phrase-based SMT between related languages"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.21236\/ADA461156"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W17-3204"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3115\/1557769.1557821"},{"key":"ref37","author":"sennrich","year":"2015","journal-title":"Neural machine translation of rare words with subword units"},{"key":"ref36","first-page":"311","article-title":"BLEU: A method for automatic evaluation of machine translation","author":"papineni","year":"2002","journal-title":"Proc Annual Meeting of the Assoc Computational Linguistics"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.3115\/1626431.1626459"},{"key":"ref34","first-page":"153","article-title":"Subgroup discovery with CN2-SD","volume":"5","author":"lavra?","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116835"},{"key":"ref40","first-page":"492","article-title":"Efficient phrase-table representation for machine translation with applications to online MT and speech translation","author":"zens","year":"2007","journal-title":"Proc Hum Lang Technol Conf North Amer Assoc Comput Linguistics Main Conf"},{"key":"ref11","first-page":"2349","article-title":"Orange: Data mining toolbox in python","volume":"14","author":"dem\u0161ar","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref12","first-page":"285","article-title":"An efficient shift-reduce decoding algorithm for phrased-based machine translation","author":"feng","year":"2010","journal-title":"Proc 23rd Int Conf Comput Linguistics Posters"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W17-3207"},{"key":"ref14","first-page":"23","article-title":"A new algorithm for data compression","volume":"12","author":"gage","year":"1994","journal-title":"C Users J"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.06.001"},{"key":"ref16","author":"graves","year":"2012","journal-title":"Sequence transduction with recurrent neural networks"},{"key":"ref17","first-page":"187","article-title":"KenLM: Faster and smaller language model queries","author":"heafield","year":"2011","journal-title":"Proc Workshop Statist Mach Translation"},{"key":"ref18","author":"hoang","year":"2016","journal-title":"Fast scalable phrase-based SMT decoding"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3115\/1622110.1622120"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30194-3_13"},{"key":"ref4","first-page":"335","article-title":"Audio chord recognition with recurrent neural networks","author":"boulanger-lewandowski","year":"2013","journal-title":"Proc ISMIR"},{"key":"ref27","first-page":"607","article-title":"Decoding complexity in word-replacement translation models","volume":"25","author":"knight","year":"1999","journal-title":"Comput Linguistics"},{"key":"ref3","first-page":"3550","article-title":"Hindencorp-hindi-english and hindi-only corpus for machine translation","author":"bojar","year":"2014","journal-title":"Proc LREC"},{"key":"ref6","first-page":"161","volume":"48113","author":"cavnar","year":"1994","journal-title":"N-Gram Based Text categorization"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815829"},{"key":"ref5","first-page":"79","article-title":"A statistical approach to machine translation","volume":"16","author":"brown","year":"1990","journal-title":"Comput Linguistics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/coli.2007.33.2.201"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1002\/wics.78","article-title":"Algorithm quasi-optimal (AQ) learning","volume":"2","author":"cervone","year":"2010","journal-title":"Wiley Interdiscipl Rev Comput Statist"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2478\/v10108-009-0011-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017011"},{"key":"ref1","author":"bahdanau","year":"2014","journal-title":"Neural machine translation by jointly learning to align and translate"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3115\/1622110.1622120"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3115\/1654494.1654500"},{"key":"ref21","first-page":"404","article-title":"Contrastive approach towards text source classification based on top-bag-of-word similarity","author":"huang","year":"2008","journal-title":"Proc of PACLIC17"},{"key":"ref42","first-page":"425","article-title":"Complete anytime beam search","author":"zhang","year":"1998","journal-title":"Proc AAAI\/IAAI"},{"key":"ref24","first-page":"982","article-title":"The TDIL program and the Indian langauge corpora intitiative (ILCI)","author":"jha","year":"2010","journal-title":"Proc LREC"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45751-8_2"},{"key":"ref23","first-page":"144","article-title":"Forest rescoring: Faster decoding with integrated language models","author":"huang","year":"2007","journal-title":"Proc 45th Annu Meeting Assoc Comput Linguistics"},{"key":"ref26","first-page":"607","article-title":"Decoding complexity in word-replacement translation models","volume":"25","author":"knight","year":"1999","journal-title":"Comput Linguistics"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32790-2_39"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08588318.pdf?arnumber=8588318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T21:56:36Z","timestamp":1643147796000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8588318\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2883738","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}