F. A. Sadkovskii, M. M. Tikhomirov, N. V. Loukachevitch
{"title":"Taxonomy Exploration with Large Language Model Reasoning and Tool Calling","authors":"F. A. Sadkovskii, M. M. Tikhomirov, N. V. Loukachevitch","doi":"10.3103/S0005105526700780","DOIUrl":null,"url":null,"abstract":"<p>The paper addresses the task of taxonomy expansion – hierarchical structures for organizing concepts. We propose an architecture based on the ReAct (Reasoning + Acting) approach that enables taxonomy expansion in a zero-shot setting without fine-tuning large language models. The system is implemented in two scenarios: autonomous navigation from root nodes and verification of hypotheses generated by other models. Experiments on the diachronic RuWordNet dataset show that direct navigation from the root faces limitations due to graph complexity (MAP@3 = 24.6%). However, using the system as a verifier improves the performance of baseline models: MAP@3 gains of 9.5 pp for FastText and 1.1 pp for TaxoYandexGPT-5-Lite. The key advantages of the approach are its universality, the absence of fine-tuning requirements, and interpretability through explicit reasoning chains.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"60 4","pages":"S459 - S467"},"PeriodicalIF":0.4000,"publicationDate":"2026-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0005105526700780","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
The paper addresses the task of taxonomy expansion – hierarchical structures for organizing concepts. We propose an architecture based on the ReAct (Reasoning + Acting) approach that enables taxonomy expansion in a zero-shot setting without fine-tuning large language models. The system is implemented in two scenarios: autonomous navigation from root nodes and verification of hypotheses generated by other models. Experiments on the diachronic RuWordNet dataset show that direct navigation from the root faces limitations due to graph complexity (MAP@3 = 24.6%). However, using the system as a verifier improves the performance of baseline models: MAP@3 gains of 9.5 pp for FastText and 1.1 pp for TaxoYandexGPT-5-Lite. The key advantages of the approach are its universality, the absence of fine-tuning requirements, and interpretability through explicit reasoning chains.
期刊介绍:
Automatic Documentation and Mathematical Linguistics is an international peer reviewed journal that covers all aspects of automation of information processes and systems, as well as algorithms and methods for automatic language analysis. Emphasis is on the practical applications of new technologies and techniques for information analysis and processing.