{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:01:26Z","timestamp":1742968886179,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031545337"},{"type":"electronic","value":"9783031545344"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-54534-4_4","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:39:18Z","timestamp":1710844758000},"page":"49-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Leveraging Taxonomic Information from\u00a0Large Language Models for\u00a0Hyponymy Prediction"],"prefix":"10.1007","author":[{"given":"Polina","family":"Chernomorchenko","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Panchenko","sequence":"additional","affiliation":[]},{"given":"Irina","family":"Nikishina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Aly, R., Acharya, S., Ossa, A., K\u00f6hn, A., Biemann, C., Panchenko, A.: Every child should have parents: a taxonomy refinement algorithm based on hyperbolic term embeddings. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Florence, Italy, pp. 4811\u20134817. Association for Computational Linguistics (2019). https:\/\/doi.org\/10.18653\/v1\/P19-1474. https:\/\/aclanthology.org\/P19-1474","key":"4_CR1","DOI":"10.18653\/v1\/P19-1474"},{"unstructured":"Brown, T.B., et al.: Language models are few-shot learners. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, 6\u201312 December 2020, virtual (2020)","key":"4_CR2"},{"doi-asserted-by":"publisher","unstructured":"Chang, D., Lin, E., Brandt, C., Taylor, R.: Incorporating domain knowledge into language models using graph convolutional networks for clinical semantic textual similarity (preprint). JMIR Med. Inform. (2020). https:\/\/doi.org\/10.2196\/23101","key":"4_CR3","DOI":"10.2196\/23101"},{"unstructured":"Chung, H.W., et al.: Scaling instruction-finetuned language models (2022)","key":"4_CR4"},{"unstructured":"Conover, M., et al.: Free Dolly: Introducing the World\u2019s First Truly Open Instruction-Tuned LLM (2023). https:\/\/www.databricks.com\/blog\/2023\/04\/12\/dolly-first-open-commercially-viable-instruction-tuned-llm","key":"4_CR5"},{"doi-asserted-by":"crossref","unstructured":"Dale, D.: A simple solution for the taxonomy enrichment task: discovering hypernyms using nearest neighbor search (2020)","key":"4_CR6","DOI":"10.28995\/2075-7182-2020-19-177-186"},{"unstructured":"Dettmers, T., Lewis, M., Belkada, Y., Zettlemoyer, L.: Llm.int8(): 8-bit matrix multiplication for transformers at scale (2022)","key":"4_CR7"},{"doi-asserted-by":"publisher","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Minneapolis, Minnesota (Volume 1: Long and Short Papers), pp. 4171\u20134186. Association for Computational Linguistics (2019). https:\/\/doi.org\/10.18653\/v1\/N19-1423. https:\/\/aclanthology.org\/N19-1423","key":"4_CR8","DOI":"10.18653\/v1\/N19-1423"},{"doi-asserted-by":"publisher","unstructured":"Dietz, L., Kotov, A., Meij, E.: Utilizing knowledge graphs in text-centric information retrieval, pp. 815\u2013816 (2017). https:\/\/doi.org\/10.1145\/3018661.3022756","key":"4_CR9","DOI":"10.1145\/3018661.3022756"},{"doi-asserted-by":"publisher","unstructured":"Ettinger, A.: What BERT is not: lessons from a new suite of psycholinguistic diagnostics for language models. Trans. Assoc. Comput. Linguist. 8, 34\u201348 (2020). https:\/\/doi.org\/10.1162\/tacl_a_00298. https:\/\/aclanthology.org\/2020.tacl-1.3","key":"4_CR10","DOI":"10.1162\/tacl_a_00298"},{"doi-asserted-by":"crossref","unstructured":"Fellbaum, C. (ed.): WordNet: An Electronic Lexical Database. Language, Speech, and Communication. MIT Press, Cambridge (1998)","key":"4_CR11","DOI":"10.7551\/mitpress\/7287.001.0001"},{"doi-asserted-by":"publisher","unstructured":"Hanna, M., Mare\u010dek, D.: Analyzing BERT\u2019s knowledge of hypernymy via prompting. In: Proceedings of the Fourth BlackboxNLP Workshop on Analyzing and Interpreting Neural Networks for NLP, Punta Cana, Dominican Republic, pp. 275\u2013282. Association for Computational Linguistics (2021). https:\/\/doi.org\/10.18653\/v1\/2021.blackboxnlp-1.20. https:\/\/aclanthology.org\/2021.blackboxnlp-1.20","key":"4_CR12","DOI":"10.18653\/v1\/2021.blackboxnlp-1.20"},{"doi-asserted-by":"publisher","unstructured":"He, B., et al.: BERT-MK: integrating graph contextualized knowledge into pre-trained language models. In: Findings of the Association for Computational Linguistics: EMNLP 2020, pp. 2281\u20132290. Association for Computational Linguistics, Online (2020). https:\/\/doi.org\/10.18653\/v1\/2020.findings-emnlp.207. https:\/\/aclanthology.org\/2020.findings-emnlp.207","key":"4_CR13","DOI":"10.18653\/v1\/2020.findings-emnlp.207"},{"unstructured":"Hu, E.J., et al.: Lora: low-rank adaptation of large language models (2021)","key":"4_CR14"},{"doi-asserted-by":"publisher","unstructured":"Huang, X., Zhang, J., Li, D., Li, P.: Knowledge graph embedding based question answering. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, WSDM 2019, pp. 105\u2013113. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3289600.3290956","key":"4_CR15","DOI":"10.1145\/3289600.3290956"},{"unstructured":"Izacard, G., Grave, E., Pilehvar, M.T., Alzantot, M., Baroni, M.: LLaMA: open and efficient foundation language models (2023)","key":"4_CR16"},{"doi-asserted-by":"publisher","unstructured":"Lester, B., Al-Rfou, R., Constant, N.: The power of scale for parameter-efficient prompt tuning. In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pp. 3045\u20133059. Association for Computational Linguistics, Online and Punta Cana, Dominican Republic (2021). https:\/\/doi.org\/10.18653\/v1\/2021.emnlp-main.243. https:\/\/aclanthology.org\/2021.emnlp-main.243","key":"4_CR17","DOI":"10.18653\/v1\/2021.emnlp-main.243"},{"doi-asserted-by":"publisher","unstructured":"Li, X.L., Liang, P.: Prefix-tuning: optimizing continuous prompts for generation. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pp. 4582\u20134597. Association for Computational Linguistics, Online (2021). https:\/\/doi.org\/10.18653\/v1\/2021.acl-long.353. https:\/\/aclanthology.org\/2021.acl-long.353","key":"4_CR18","DOI":"10.18653\/v1\/2021.acl-long.353"},{"unstructured":"Logan, R.L., IV., Bala\u017eevi\u0107, I., Wallace, E., Petroni, F., Singh, S., Riedel, S.: Cutting down on prompts and parameters: simple few-shot learning with language models. CoRR abs\/2106.13353 (2021). https:\/\/arxiv.org\/abs\/2106.13353","key":"4_CR19"},{"unstructured":"Nikishina, I., Vakhitova, A., Tutubalina, E., Panchenko, A.: Cross-modal contextualized hidden state projection method for expanding of taxonomic graphs. In: Proceedings of TextGraphs-16: Graph-Based Methods for Natural Language Processing, Gyeongju, Republic of Korea, pp. 11\u201324. Association for Computational Linguistics (2022). https:\/\/aclanthology.org\/2022.textgraphs-1.2","key":"4_CR20"},{"unstructured":"Ouyang, L., et al.: Training language models to follow instructions with human feedback (2022)","key":"4_CR21"},{"unstructured":"Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I.: Language models are unsupervised multitask learners (2018). https:\/\/d4mucfpksywv.cloudfront.net\/better-language-models\/language-models.pdf","key":"4_CR22"},{"unstructured":"Raffel, C., et al.: Exploring the limits of transfer learning with a unified text-to-text transformer. J. Mach. Learn. Res. 21(140), 1\u201367 (2020). http:\/\/jmlr.org\/papers\/v21\/20-074.html","key":"4_CR23"},{"unstructured":"Touvron, H., et al.: LLaMA 2: open foundation and fine-tuned chat models (2023)","key":"4_CR24"},{"doi-asserted-by":"publisher","unstructured":"Vuli\u0107, I., Ponti, E.M., Litschko, R., Glava\u0161, G., Korhonen, A.: Probing pretrained language models for lexical semantics. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 7222\u20137240. Association for Computational Linguistics, Online (2020). https:\/\/doi.org\/10.18653\/v1\/2020.emnlp-main.586. https:\/\/aclanthology.org\/2020.emnlp-main.586","key":"4_CR25","DOI":"10.18653\/v1\/2020.emnlp-main.586"},{"unstructured":"Wiedemann, G., Remus, S., Chawla, A., Biemann, C.: Does BERT make any sense? interpretable word sense disambiguation with contextualized embeddings (2019)","key":"4_CR26"},{"unstructured":"Zhou, R., et al.: WCL-BBCD: a contrastive learning and knowledge graph approach to named entity recognition (2022)","key":"4_CR27"},{"unstructured":"Zhou, Y., et al.: Large language models are human-level prompt engineers. In: The Eleventh International Conference on Learning Representations (2023). https:\/\/openreview.net\/forum?id=92gvk82DE-","key":"4_CR28"}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54534-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:40:17Z","timestamp":1710844817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54534-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031545337","9783031545344"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54534-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yerevan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Armenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.62","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Out of the 93 submission, 17 were rejected before being sent to peer review.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}