Hasil untuk "Lexicography"

N. Immerman

Michael E. Wolf, M. Lam

J. Faugère, P. Gianni, D. Lazard et al.

Irina P. Lukina

The paper discusses the scientific, theoretical and practical problems of linguistic and cultural description of Chuvash toponyms. The purpose of the study is to determine the basic principles of lexicographic fixation of Chuvash geographical names with pronounced national and cultural semantics. For the first time, a comprehensive study of the linguistic and cultural potential of regional toponyms has been undertaken, and thematic groups of geographical names have been identified. The article highlights the need for a multidimensional analysis of toponymic systems. The dictionary entries Shupashkar “Cheboksary” and Atə̂l “Volga” are presented as an example. The associative experiment is considered as one of the ways to obtain relevant national and cultural information. The main research methods are the methods of structural and word-formation, linguistic and linguocultural analysis. The author comes to the conclusion that the dictionary entry in the future linguistic dictionary should have the following structure: “Headline word”, sections “Encyclopedic reference”, “In culture”, “In language and speech”. The main criteria for selecting geographical names for the dictionary should be their current representation in the public consciousness and regional value, which are manifested at the linguistic level by the presence of well-known reproducible phrases, the use of a toponym to name objects of other onomastic classes, the use of permanent epithets, the possibility of metaphorical correlation with another well-known place name, the existence of peripheral names, intersection with the biography of famous figures national history and culture.

Tetiana Kosmeda, Vitaliia Papish

This article presents a comprehensive overview of the historical roots, emergence and contemporary development of Ukrainian psycholinguistics, emphasizing its distinct national trajectory and intellectual legacy. It challenges the misconception that Ukrainian psycholinguistics was absent or insignificant during the Soviet era, arguing instead for the recognition of a robust but suppressed scholarly tradition shaped by figures such as Olexander Potebnia, Ivan Franko, Dmytro Ovsianyko-Kulykovskyi, and others. During the totalitarian regime, many Ukrainian contributions were published in Russian or attributed to Soviet science, contributing to a colonial narrative that marginalized national achievements. Employing an aspectual-fragmentary approach, the article delineates the evolution of psycholinguistics in Ukraine from the mid-20th century to the present, outlining the methodological, thematic, and institutional developments that characterize both the totalitarian and post-totalitarian periods. It highlights the formation of prominent Ukrainian psycholinguistic schools and research centres—particularly in Pereiaslav, Lutsk, Odesa, Kharkiv, Lviv—and explores their contributions in areas such as psychosemiotics, suggestive linguistics, neurolinguistic programming, linguistic personology, and associative lexicography. The study also underscores the revival of previously prohibited theoretical paradigms, such as the “spirit of language,” language’s divine origin, and the unconscious in speech. Special attention is given to the current push toward nation-centered historiography, which seeks to restore historical memory and counter lingering colonial influences. The paper advocates for a methodological shift toward Ukrainian psycholinguistic historiography and the institutionalization of a new academic discipline: the History of National Psycholinguistics.Ultimately, this work affirms Ukraine’s independent and innovative contribution to global psycholinguistics, proposing a critical re-evaluation of Soviet-era publications and the reclamation of intellectual heritage obscured by linguistic and cultural suppression. The study contributes to both the academic reconstruction of Ukrainian psycholinguistics and the broader project of decolonizing national science. Disclosure Statement The authors reported no potential conflicts of interest.

Ruslan Mitkov

R. Stanley

Jan Holeš, Zuzana Honová

Treatment of pharmaceutical terminology in the digitized version of the Dictionnaire de l’Académie française. This article aims to examine the treatment of pharmaceutical terms in the digitized version of the Dictionnaire de l’Académie française on the example of pharmacy terminology. After a brief presentation of the dictionary microstructure and its current edition, the authors describe the terms marked as belonging to the field of pharmacy, presenting the reasons of these changes, the appearance and disappearance of the terms, the migration of terms between several fields, the passage of words from the common language into terminology and vice versa. The article also shows certain inconsistencies in the treatment of terminology in the Dictionnaire de l’Académie française.

Nicola Cotumaccio, G. D’Agostino, A. Policriti et al.

The states of a finite-state automaton 𝒩 can be identified with collections of words in the prefix closure of the regular language accepted by 𝒩. But words can be ordered, and among the many possible orders a very natural one is the co-lexicographic order. Such naturalness stems from the fact that it suggests a transfer of the order from words to the automaton’s states. This suggestion is, in fact, concrete and in a number of articles automata admitting a total co-lexicographic (co-lex for brevity) ordering of states have been proposed and studied. Such class of ordered automata — Wheeler automata — turned out to require just a constant number of bits per transition to be represented and enable regular expression matching queries in constant time per matched character. Unfortunately, not all automata can be totally ordered as previously outlined. In the present work, we lay out a new theory showing that all automata can always be partially ordered, and an intrinsic measure of their complexity can be defined and effectively determined, namely, the minimum width p of one of their admissible co-lex partial orders–dubbed here the automaton’s co-lex width. We first show that this new measure captures at once the complexity of several seemingly-unrelated hard problems on automata. Any NFA of co-lex width p: (i) has an equivalent powerset DFA whose size is exponential in p rather than (as a classic analysis shows) in the NFA’s size; (ii) can be encoded using just Θ(log p) bits per transition; (iii) admits a linear-space data structure solving regular expression matching queries in time proportional to p2 per matched character. Some consequences of this new parameterization of automata are that PSPACE-hard problems such as NFA equivalence are FPT in p, and quadratic lower bounds for the regular expression matching problem do not hold for sufficiently small p. Having established that the co-lex width of an automaton is a fundamental complexity measure, we proceed by (i) determining its computational complexity and (ii) extending this notion from automata to regular languages by studying their smallest-width accepting NFAs and DFAs. In this work we focus on the deterministic case and prove that a canonical minimum-width DFA accepting a language ℒ–dubbed the Hasse automaton ℋ of ℒ–can be exhibited. ℋ provides, in a precise sense, the best possible way to (partially) order the states of any DFA accepting ℒ, as long as we want to maintain an operational link with the (co-lexicographic) order of ℒ’s prefixes. Finally, we explore the relationship between two conflicting objectives: minimizing the width and minimizing the number of states of a DFA. In this context, we provide an analogue of the Myhill-Nerode Theorem for co-lexicographically ordered regular languages.

Lysandros Tziovani, L. Hadjidemetriou, Charalampos Charalampous et al.

Peak shaving applications provided by energy storage systems enhance the utilization of existing grid infrastructure to accommodate the increased penetration of renewable energy sources. This work investigates the provision of peak shaving services from a flywheel energy storage system installed in a transformer substation. A lexicographic optimization scheme is formulated to define the flywheel power set-points by minimizing the transformer power limit violations and the flywheel energy losses. Convex functions that represent the flywheel power losses and its maximum power are derived and integrated in the proposed scheme. A two-level hierarchical control framework is introduced to operate the transformer-flywheel-system in a way that handles prediction errors and modelling inaccuracies. At the higher level, a model predictive controller is developed that solves the lexicographic optimization scheme using linear programming. At the lower-level, a secondary controller corrects the power set-points of the model predictive controller using real-time measurements. A software platform has been developed for integrating the proposed controllers in an experimental setup to test their effectiveness in a realistic testbed setting, and the flywheel system characteristics are experimentally identified. Simulation and experimental results validate and verify the modeling, identification, control and operation of a real flywheel system for peak shaving services.

Alin C. Popescu, Hany Farid

J. Skalse, Lewis Hammond, Charlie Griffin et al.

In this work we introduce reinforcement learning techniques for solving lexicographic multi-objective problems. These are problems that involve multiple reward signals, and where the goal is to learn a policy that maximises the first reward signal, and subject to this constraint also maximises the second reward signal, and so on. We present a family of both action-value and policy gradient algorithms that can be used to solve such problems, and prove that they converge to policies that are lexicographically optimal. We evaluate the scalability and performance of these algorithms empirically, and demonstrate their applicability in practical settings. As a more specific application, we show how our algorithms can be used to impose safety constraints on the behaviour of an agent, and compare their performance in this context with that of other constrained reinforcement learning algorithms.

G. Abend

Songsong Liu, L. Papageorgiou

Ivica Mataija

Based on researching the reference literature, archival materials, and available sources, this paper describes the reflection of the personal name of the author of the first Croatian novel on Croatia’s toponymy and chrematonymy. Special attention is given to historical circumstances, motivation, naming principles, and impacts on the formation of Velebit’s present-day oronymy, whose examples frequently point to the issue of the standardisation of geographical names, the lack of a legislative solution that would precisely stipulate the landform naming procedure, and the necessity to establish a national-level expert body that would decide on the official figures of Croatian toponyms that are recorded on maps. The section on hodonymy and chrematonymy chiefly examines the wider Zadar region, where the reflection of the writer’s personal name is clearly the most widespread.

This overview critical article presents an analysis of the collective monograph devoted to the novel by V. I. Belov “Privychnoe delo” [“The Usual Thing”]. It is a reference book and an encyclopedia covering a wide range of literary, linguistic, historical, cultural and philosophical concepts and ideas reflected on the pages of the top work of the Vologda writer. For the first time, the book under review provides a comprehensive assessment of the philological content, personal range, regionalisms and other related facts of the artistic canvas. It includes a bibliography of the novel and summarizes the history of the study of this work in literary criticism. The critical and analytical part of the review characterizes the typical features of the dictionary, points out obvious mistakes and errors in the interpretation of the nominations, notes the shortcomings of the search engine, clarifies and supplements the author’s formulations, examines and discusses the specific facts of the book in order to improve the structure and content of the publication for further use of the experience of creating an encyclopedia of one work in scholarly and educational theory and practice.

E. Gabrilovich, Shaul Markovitch

Adequate representation of natural language semantics requires access to vast amounts of common sense and domain-specific world knowledge. Prior work in the field was based on purely statistical techniques that did not make use of background knowledge, on limited lexicographic knowledge bases such as WordNet, or on huge manual efforts such as the CYC project. Here we propose a novel method, called Explicit Semantic Analysis (ESA), for fine-grained semantic interpretation of unrestricted natural language texts. Our method represents meaning in a high-dimensional space of concepts derived from Wikipedia, the largest encyclopedia in existence. We explicitly represent the meaning of any text in terms of Wikipedia-based concepts. We evaluate the effectiveness of our method on text categorization and on computing the degree of semantic relatedness between fragments of natural language text. Using ESA results in significant improvements over the previous state of the art in both tasks. Importantly, due to the use of natural concepts, the ESA model is easy to explain to human users.

Funda Samanlioglu

K. Fletcher

Junfu Yin, Z. Zheng, Longbing Cao