{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:20:46Z","timestamp":1760242846926,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2016,12,30]],"date-time":"2016-12-30T00:00:00Z","timestamp":1483056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We provide an upper bound for the amount of information a human translator adds to an original text, i.e., how many bits of information we need to store a translation, given the original. We do this by creating a Bilingual Shannon Game that elicits character guesses from human subjects, then developing models to estimate the entropy of those guess sequences.<\/jats:p>","DOI":"10.3390\/e19010015","type":"journal-article","created":{"date-parts":[[2016,12,30]],"date-time":"2016-12-30T08:48:53Z","timestamp":1483087733000},"page":"15","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Humans Outperform Machines at the Bilingual Shannon Game"],"prefix":"10.3390","volume":"19","author":[{"given":"Marjan","family":"Ghazvininejad","sequence":"first","affiliation":[{"name":"Information Sciences Institute, University of Southern California, 4676 Admiralty Way #1001, Marina Del Rey, CA 90292, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Knight","sequence":"additional","affiliation":[{"name":"Information Sciences Institute, University of Southern California, 4676 Admiralty Way #1001, Marina Del Rey, CA 90292, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2016,12,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Zoph, B., Ghazvininejad, M., and Knight, K. (2015, January 17\u201321). How Much Information Does a Human Translator Add to the Original?. Proceedings of the Conference on Empirical Methods in Natural Language Processing, Lisbon, Portugal.","DOI":"10.18653\/v1\/D15-1105"},{"key":"ref_2","unstructured":"Bilingual Compression Challenge. Available online: http:\/\/www.isi.edu\/natural-language\/compression."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/j.1538-7305.1951.tb01366.x","article-title":"Prediction and Entropy of Printed English","volume":"30","author":"Shannon","year":"1951","journal-title":"Bell Syst. Tech. J."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TIT.1981.1056282","article-title":"Universal modeling and coding","volume":"27","author":"Rissanen","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","article-title":"Data compression using adaptive coding and partial string matching","volume":"32","author":"Cleary","year":"1984","journal-title":"IEEE Trans. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","article-title":"Arithmetic coding for data compression","volume":"30","author":"Witten","year":"1987","journal-title":"Commun. ACM"},{"key":"ref_7","first-page":"31","article-title":"An estimate of an upper bound for the entropy of English","volume":"18","author":"Brown","year":"1992","journal-title":"Comput. Linguist."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1002\/spe.4380250804","article-title":"Adding compression to a full-text retrieval system","volume":"25","author":"Zobel","year":"1995","journal-title":"Softw. Pract. Exp."},{"key":"ref_9","unstructured":"Teahan, W.J., and Cleary, J.G. (April, January 31). The entropy of English using PPM-based models. Proceedings of the IEEE Data Compression Conference (DCC \u201996), Snowbird, UT, USA."},{"key":"ref_10","unstructured":"Witten, I., Moffat, A., and Bell, T. (1999). Managing Gigabytes: Compressing and Indexing Documents And Images, Morgan Kaufmann."},{"key":"ref_11","unstructured":"Mahoney, M. (2005). Adaptive Weighting of Context Models for Lossless Data Compression, Florida Institute of Technology. Technical Report CS-2005-16."},{"key":"ref_12","unstructured":"Hutter, M. 50,000 Euro Prize for Compressing Human Knowledge. Available online: http:\/\/prize.hutter1.net."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1142\/S0129054108005553","article-title":"Using alignment for multilingual text compression","volume":"19","author":"Conley","year":"2008","journal-title":"Int. J. Found. Comput. Sci."},{"key":"ref_14","unstructured":"Mart\u00ednez-Prieto, M., Adiego, J., S\u00e1nchez-Mart\u00ednez, F., de la Fuente, P., and Carrasco, R.C. (April, January 30). On the use of word alignments to enhance bitext compression. Proceedings of the Data Compression Conference, Snowbird, UT, USA."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Adiego, J., Brisaboa, N., Mart\u00ednez-Prieto, M., and S\u00e1nchez-Mart\u00ednez, F. (2009, January 25\u201327). A two-level structure for compressing aligned bitexts. Proceedings of the 16th International Symposium on String Processing and Information Retrieval, Saariselka, Finland.","DOI":"10.1007\/978-3-642-03784-9_11"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Adiego, J., Mart\u00ednez-Prieto, M., Hoyos-Tor\u00edo, J., and S\u00e1nchez-Mart\u00ednez, F. (2010, January 24\u201326). Modelling parallel texts for boosting compression. Proceedings of the Data Compression Conference, Snowbird, UT, USA.","DOI":"10.1109\/DCC.2010.86"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1613\/jair.3500","article-title":"Generalized biwords for bitext compression and translation spotting","volume":"43","author":"Carrasco","year":"2012","journal-title":"J. Artif. Intell. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s11786-012-0138-1","article-title":"Improved Alignment-Based Algorithm for Multilingual Text Compression","volume":"7","author":"Conley","year":"2013","journal-title":"Math. Comput. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/S0019-9958(64)90326-2","article-title":"A note on the entropy of words in printed English","volume":"7","author":"Grignetti","year":"1964","journal-title":"Inf. Control"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"650","DOI":"10.2307\/1418794","article-title":"Long-range constraints in the statistical structure of printed English","volume":"68","author":"Burton","year":"1955","journal-title":"Am. J. Psychol."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0022-5371(66)80103-2","article-title":"The effects of authorship, topic, structure, and time of composition on letter redundancy in English texts","volume":"5","author":"Paisley","year":"1966","journal-title":"J. Verbal Learn. Verbal Behav."},{"key":"ref_22","unstructured":"Guerrero, F. (2009). A New Look at the Classical Entropy of Written English. arXiv."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0019-9958(68)90261-1","article-title":"A note on the entropy of partially-known languages","volume":"12","author":"Jamison","year":"1968","journal-title":"Inf. Control"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1016\/S0019-9958(65)90435-3","article-title":"A note on entropy of Kannada prose","volume":"8","author":"Rajagopalan","year":"1965","journal-title":"Inf. Control"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0019-9958(60)90731-2","article-title":"The redundancy of texts in three languages","volume":"3","author":"Newman","year":"1960","journal-title":"Inf. Control"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0019-9958(63)90354-1","article-title":"Entropy of Tamil prose","volume":"6","author":"Siromoney","year":"1963","journal-title":"Inf. Control"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/TIT.1976.1055498","article-title":"First second-and third-order entropies of Arabic text (Corresp.)","volume":"22","author":"Wanas","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/TIT.1978.1055912","article-title":"A convergent gambling estimate of the entropy of English","volume":"24","author":"Cover","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/0306-4573(92)90068-B","article-title":"Compression of parallel texts","volume":"28","author":"Nevill","year":"1992","journal-title":"Inf. Process. Manag."},{"key":"ref_30","unstructured":"Koehn, P. (2005, January 12\u201316). Europarl: A parallel corpus for statistical machine translation. Proceedings of the Machine Translation Summit X, Phuket, Thailand."},{"key":"ref_31","unstructured":"Cover, T., and Thomas, J. (2006). Elements of Information Theory, Wiley-Interscience. [2nd ed.]."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/1\/15\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:29:36Z","timestamp":1760210976000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/1\/15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,30]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1]]}},"alternative-id":["e19010015"],"URL":"https:\/\/doi.org\/10.3390\/e19010015","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2016,12,30]]}}}