{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:23:06Z","timestamp":1740169386103,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100023652","name":"Sveu\u010dili\u0161te u Rijeci","doi-asserted-by":"publisher","award":["uniri-iskusni-drustv-23-95"],"award-info":[{"award-number":["uniri-iskusni-drustv-23-95"]}],"id":[{"id":"10.13039\/501100023652","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3402830","type":"journal-article","created":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T17:28:15Z","timestamp":1716226095000},"page":"71361-71370","source":"Crossref","is-referenced-by-count":0,"title":["Recursively Autoregressive Autoencoder for Pyramidal Text Representation"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6343-0938","authenticated-orcid":false,"given":"Karlo","family":"Babi\u0107","sequence":"first","affiliation":[{"name":"Faculty of Informatics and Digital Technologies, University of Rijeka, Rijeka, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9513-9467","authenticated-orcid":false,"given":"Ana","family":"Me\u0161trovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Informatics and Digital Technologies, University of Rijeka, Rijeka, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Efficient estimation of word representations in vector space","author":"Mikolov","year":"2013","journal-title":"arXiv:1301.3781"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.5555\/3044805.3045025"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00051"},{"key":"ref5","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"Devlin","year":"2018","journal-title":"arXiv:1810.04805"},{"issue":"140","key":"ref6","first-page":"1","article-title":"Exploring the limits of transfer learning with a unified text-to-text transformer","volume":"21","author":"Raffel","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref7","first-page":"1877","article-title":"Language models are few-shot learners","volume":"33","author":"Brown","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref8","article-title":"Bloom: A 176b-parameter open-access multilingual language model","author":"Le Scao","year":"2023","journal-title":"arXiv:2211.05100"},{"key":"ref9","article-title":"LLaMA: Open and efficient foundation language models","author":"Touvron","year":"2023","journal-title":"arXiv:2302.13971"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.31341\/jios.44.2.2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3388218.3388229"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.2017.41"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3439726"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/app112110442"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107134"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-1781-2_35"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981314"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.13386"},{"key":"ref19","article-title":"A survey of large language models","author":"Zhao","year":"2023","journal-title":"arXiv:2303.18223"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3390\/info11110511"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3560815"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref23","first-page":"104","article-title":"Better word representations with recursive neural networks for morphology","volume-title":"Proc. 17th Conf. Comput. Natural Lang. Learn.","author":"Luong"},{"key":"ref24","first-page":"1631","article-title":"Recursive deep models for semantic compositionality over a sentiment treebank","volume-title":"Proc. Conf. Empir. Methods Nat. Lang. Process.","author":"Socher"},{"volume-title":"Linguistics for Dummies","year":"2012","author":"Dechaine","key":"ref25"},{"key":"ref26","first-page":"151","article-title":"Semi-supervised recursive autoencoders for predicting sentiment distributions","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process","author":"Socher"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/n19-1116"},{"key":"ref28","first-page":"1","article-title":"Deep recursive neural networks for compositionality in language","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"27","author":"Irsoy"},{"key":"ref29","article-title":"Understanding composition of word embeddings via tensor decomposition","author":"Frandsen","year":"2019","journal-title":"arXiv:1902.00613"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/E17-1006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1107"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/p15-1150"},{"key":"ref33","first-page":"1","article-title":"Self-adaptive hierarchical sentence model","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Zhao"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5947"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-naacl.117"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-96957-8_34"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3758\/s13428-022-01802-x"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10534761.pdf?arnumber=10534761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T17:28:49Z","timestamp":1716571729000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10534761\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3402830","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}