Hasil untuk "Folklore"

H. Situngkir, A. B. Lumbantobing, Y. Surya

This paper presents a novel syllable-based tokenization approach for Indonesian large language models, inspired by the Gasing Literacy Learning System's pedagogical methodology. Drawing on information-theoretic principles, we develop a tokenization framework that segments Indonesian text at syllable boundaries before applying byte-pair encoding, creating a vocabulary that aligns with the language's morphophonological structure. Our approach first identifies high-frequency syllables through rule-based segmentation, then constructs a compact vocabulary of 3,500 tokens that preserves meaningful linguistic units while maintaining coverage through character-level fallback. Empirical evaluation on Indonesian Wikipedia and folklore corpora from Indonesian Culture Digital Library (PDBI) demonstrates substantial improvements over conventional tokenization methods: the syllable-based approach achieves Rényi efficiency of 0.74 compared to 0.50-0.64 for pretrained multilingual tokenizers, while maintaining higher average token lengths (3.67 characters versus 2.72 for GPT-2) despite using a vocabulary an order of magnitude smaller. These gains emerge from the method's ability to internalize character-level dependencies within syllable units, reducing the computational burden on language models while respecting Indonesian's agglutinative morphology. We call the LLM built upon this principle, TOBA LLM (Tokenisasi Optimum Berbasis Aglutinasi), the convergence of human literacy pedagogy with computational optimization principles offers a promising paradigm for developing linguistically-informed tokenization strategies, particularly for morphologically rich and underrepresented languages in natural language processing.

Jie Cao, Shilei Fan, Yong Han et al.

We resolve a folklore problem of determining the optimal hypercontractive constants $r_{p,q}(\mathbb{Z}_3)$ for the cyclic group $\mathbb{Z}_3$ for all $1 < p < q < \infty$. More precisely, we have \[ r_{p,q}(\mathbb{Z}_3) = \frac{(1 + 2x)(1 - y)}{(1 + 2y)(1 - x)}, \] where $(x,y)$ is the unique solution in the open unit square $(0,1)\times (0,1)$ to the system of equations \begin{align*} \left\{ \begin{aligned} &\frac{1}{1+2x}\Big(\frac{1+2x^p}{3}\Big)^{\frac{1}{p}}=\frac{1}{1+2y}\Big(\frac{1+2y^q}{3}\Big)^{\frac{1}{q}},\\ &\frac{(1-x)(1-x^{p-1})}{1+2x^p}=\frac{(1-y)(1-y^{q-1})}{1+2y^q}. \end{aligned} \right. \end{align*} Consequently, for rational $p, q\in \mathbb{Q}$, the constants $r_{p,q}(\mathbb{Z}_3)$ are algebraic numbers which generally admit no radical expressions, since their often rather complicated minimal polynomials may have non-solvable Galois groups. Our formalism relies on a key observation: the existence of nontrivial critical extremizers. This approach can also be adapted to resolve a long-standing open problem -- determining all optimal $(p,q)$-hypercontractive constants for biased Bernoulli random variables, which are closely related to noise operators. Several noteworthy phenomena emerge from numerical simulations: the monotonicity of the hypercontractive constants in the parameters, and the appearance of intriguing limit shapes. These phenomena merit further investigation.

Iwona Rzepnikowska

Artykuł jest poświęcony problematyce żałoby i wdowieństwa w polskiej kulturze ludowej. W charakterze materiału egzemplifikacyjnego wykorzystano źródła etnograficzne i teksty folkloru słownego. W analizie żałoby uwzględniono następujące zagadnienia: długość jej trwania i korelacja z płcią, wiekiem, statusem rodzinnym i społecznym zmarłej osoby, żałobna odzież, reguły zachowania w życiu codziennym i obrzędowym obowiązujące krewnych zmarłego, oznaczanie domu żałoby, powiadomienia o śmierci mieszkańców wsi, czuwanie przy ciele zmarłego. Natomiast zjawisko wdowieństwa zostało rozpatrzone w kontekście idei nieparzystości. Z jednej strony przejawia się to w negatywnej waloryzacji osób owdowiałych, zwłaszcza w kontekście kandydatów na męża/żonę, z drugiej – w chęci, a nawet konieczności zawarcia kolejnego związku. Na poziomie symbolicznym można to rozumieć jako dążenie do parzystości, stabilności i pełni. W praktyce powtórne małżeństwo miało wymiar bardziej przyziemny podyktowany względami czysto gospodarczymi.

Şahin BÜTÜNER , Wang YUXUN

In the globalization process, cultural symbols of every country have become increasingly important. These symbols, as important carriers of culture, play a significant role in the transmission of cultural heritage. The Evil Eye Bead is a sacred object believed to protect the Turkish nation from evil eyes and bring peace and happiness to humanity. The Chinese Knot, on the other hand, is a sacred object believed to grant good luck, luck, fortune, prosperity, and happiness to the Chinese nation. Researchers in Türkiye have generally focused on its origins, areas of application, and religious affiliations. Based on book and literature reviews conducted in various fields in China, researchers have conducted a wide range of studies on the Chinese Knot. These studies generally cover a wide range of fields, including traditional art, semiotics, historical evolution, and cultural symbolism. This study, based on a folklore perspective, conducts a comparative study of the Evil Eye Bead and the Chinese Knot in terms of their historical background, shape and color characteristics, symbolic meaning and reproduction, and current uses. This study aims to gain a deeper understanding of the cultural traditions of Turkey and China and to compare the two countries' positions on cultural modernization. This study aims to examine the similarities and differences between these two cultural symbols. The impact of the current globalization environment on the spread and acceptance of these two symbols is critically discussed, and it recommends prioritizing cultural diversity and cultural preservation. The evil eye bead and the Chinese knot are objects of folklore research, possessing material forms that carry specific cultural meaning and value. Material folklore encompasses traditional habits formed through people's relationship with nature and their struggles against it. Today, the spread and acceptance of the evil eye bead and the Chinese knot, particularly in the context of globalization in jewelry design, has positively impacted and become a source of inspiration for jewelry design.

Ziang Chen, Jialin Liu, Xiaohan Chen et al.

Graph neural networks (GNNs) have been widely used to predict properties and heuristics of mixed-integer linear programs (MILPs) and hence accelerate MILP solvers. This paper investigates the capacity of GNNs to represent strong branching (SB), the most effective yet computationally expensive heuristic employed in the branch-and-bound algorithm. In the literature, message-passing GNN (MP-GNN), as the simplest GNN structure, is frequently used as a fast approximation of SB and we find that not all MILPs's SB can be represented with MP-GNN. We precisely define a class of "MP-tractable" MILPs for which MP-GNNs can accurately approximate SB scores. Particularly, we establish a universal approximation theorem: for any data distribution over the MP-tractable class, there always exists an MP-GNN that can approximate the SB score with arbitrarily high accuracy and arbitrarily high probability, which lays a theoretical foundation of the existing works on imitating SB with MP-GNN. For MILPs without the MP-tractability, unfortunately, a similar result is impossible, which can be illustrated by two MILP instances with different SB scores that cannot be distinguished by any MP-GNN, regardless of the number of parameters. Recognizing this, we explore another GNN structure called the second-order folklore GNN (2-FGNN) that overcomes this limitation, and the aforementioned universal approximation theorem can be extended to the entire MILP space using 2-FGNN, regardless of the MP-tractability. A small-scale numerical experiment is conducted to directly validate our theoretical findings.

Lucia Kvočáková

After 1918, in the changed socio-political landscape following the establishment of Czechoslovakia, the search for national identity emerged as a key topic in intellectual discussions. Questions of self-definition in relation to Hungarians, Czechs, and Europe became prominent within the Slovak cultural and intellectual landscape. The leading figures in Slovak modern visual art developed a distinctively Slovak style, primarily focused on themes of the Slovak countryside and traditional folklore. This paper examines the creation of “Slovakness” in art and the role of Czech cultural actors in Slovakia. It highlights the importance of national identity in visual arts through texts published in periodicals that aligned with the programmatic Slovak orientation of significant modern Slovak artists, including Janko Alexy (1894–1970), Miloš Alexander Bazovský (1899–1968), Ľudovít Fulla (1902–1980), and Mikuláš Galanda (1895–1938). The analysed articles played a significant role in shaping ideas about the identity of Slovak art, often having a broader social impact than the artists’ exhibitions—even though the programmatic Slovak orientation they advocated was not always fully reflected in them.

Ruslan Serdeha

The purpose of the article: is to analyse the works of Mykola Fedorovych Sumtsov on oral folklore, to find out his contribution to the study of the language of folklore and to establish the significance of his folklore achievements for the further development of linguistic and folklore science in Ukraine. Research methodology: general scientific methods of analysis and synthesis, as well as special historical methods-chronological and comparative historical-were used. Scientific novelty. For the first time in Ukrainian science, the works of the famous Kharkiv humanitarian scientist Mykola Fedorovych Sumtsov examined through the prism of linguofolklore. His role in the formation of this scientific field is determined. Conclusions. In his works, M. F. Sumtsov laid the groundwork for future linguistic studies in the field of linguofolklore. He sees the folklore of the Ukrainian people as an original, original and unique phenomenon, based on a broad international context. He saw in the Ukrainian language «the best manifestation of national life», «the treasury of the national spirit». Long before the separation of lingo-folklore studies into a separate branch of linguistic science, which began to take shape in the 70s of the twentieth century, M. F. Sumtsov outlined the search tasks of this field of knowledge. When studying works of oral folk literature, he calls for a close look at their language, especially the language of songs, fairy tales, and proverbs, and to look for the most characteristic features in it, that is, the language of folklore, which hide the deep sources of folk art as such. As a researcher of folklore and as a scholar in general, M. F. Sumtsov impresses with the diversity of his research. His scientific achievements in general and those in the field of folklore studies in particular are striking in their versatility, deep understanding of the problems under study, and interdisciplinary approach to their solution. The researcher takes into account heterogeneous folklore material: apocrypha, wedding songs, dumas, historical songs, fairy tales, lullabies, carols, shchedrivkas, Kupala songs, legends, and other manifestations of folk verbal creativity.

Amirhossein Reisizadeh, Haochuan Li, Subhro Das et al.

Gradient clipping is a standard training technique used in deep learning applications such as large-scale language modeling to mitigate exploding gradients. Recent experimental studies have demonstrated a fairly special behavior in the smoothness of the training objective along its trajectory when trained with gradient clipping. That is, the smoothness grows with the gradient norm. This is in clear contrast to the well-established assumption in folklore non-convex optimization, a.k.a. $L$--smoothness, where the smoothness is assumed to be bounded by a constant $L$ globally. The recently introduced $(L_0,L_1)$--smoothness is a more relaxed notion that captures such behavior in non-convex optimization. In particular, it has been shown that under this relaxed smoothness assumption, SGD with clipping requires $O(ε^{-4})$ stochastic gradient computations to find an $ε$--stationary solution. In this paper, we employ a variance reduction technique, namely SPIDER, and demonstrate that for a carefully designed learning rate, this complexity is improved to $O(ε^{-3})$ which is order-optimal. Our designed learning rate comprises the clipping technique to mitigate the growing smoothness. Moreover, when the objective function is the average of $n$ components, we improve the existing $O(nε^{-2})$ bound on the stochastic gradient complexity to $O(\sqrt{n} ε^{-2} + n)$, which is order-optimal as well. In addition to being theoretically optimal, SPIDER with our designed parameters demonstrates comparable empirical performance against variance-reduced methods such as SVRG and SARAH in several vision tasks.

Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga et al.

The directed acyclic word graph (DAWG) of a string $y$ of length $n$ is the smallest (partial) DFA which recognizes all suffixes of $y$ with only $O(n)$ nodes and edges. In this paper, we show how to construct the DAWG for the input string $y$ from the suffix tree for $y$, in $O(n)$ time for integer alphabets of polynomial size in $n$. In so doing, we first describe a folklore algorithm which, given the suffix tree for $y$, constructs the DAWG for the reversed string of $y$ in $O(n)$ time. Then, we present our algorithm that builds the DAWG for $y$ in $O(n)$ time for integer alphabets, from the suffix tree for $y$. We also show that a straightforward modification to our DAWG construction algorithm leads to the first $O(n)$-time algorithm for constructing the affix tree of a given string $y$ over an integer alphabet. Affix trees are a text indexing structure supporting bidirectional pattern searches. We then discuss how our constructions can lead to linear-time algorithms for building other text indexing structures, such as linear-size suffix tries and symmetric CDAWGs in linear time in the case of integer alphabets. As a further application to our $O(n)$-time DAWG construction algorithm, we show that the set $\mathsf{MAW}(y)$ of all minimal absent words (MAWs) of $y$ can be computed in optimal, input- and output-sensitive $O(n + |\mathsf{MAW}(y)|)$ time and $O(n)$ working space for integer alphabets.

Galimzyanova A.T, Gallyamova A.G.

Research objectives: To contribute to the analysis of the conditions and factors, as well as the results of the activities of Tatar humanitarian specialists in the 1930s–1950s. The article deals with the actual aspects of studying the history of historical science in one of the major regions of Russia – the Republic of Tatarstan – during the Soviet period. It highlights the process of statization of the activities of historians and the dramatic conflicts associated with their subordination to the official Marxist-Leninist concept of periodization of human history. In connection with the restoration of historical science in the beginning of the 1930s, there arose a need to expand the network of research institutes designed to study the regional history and culture. In the Tatar ASSR, such a task was entrusted to the Institute of Language, Literature, and History (IYALI), established in 1939, and mainly to its history sector formed in 1941. Research materials: The article is based on the analysis of a vast array of unpublished sources, which made it possible to reveal the role of not only the August (1944) Decree of the Central Committee of the Communist Party of the Soviet Union but also other directives and guidelines issued by the Soviet government over two decades (1940–1950s). Results and novelty of the research: The article describes in detail the process of the development of the two-volume “History of the Tatar ASSR”, whose writing was entrusted to the staff of the Institute of Language, Literature, and History (IYALI). The study showed that the content of the book changed many times and adjusted to the directives of the highest political and ideological authorities, which abounded in the period of late Stalinism. The August (1944) Decree of the Central Committee of the Communist Party of the Soviet Union had the greatest influence on the scientific activities of Kazan historians. It became the main guide to the action of the Republic authorities, called upon to strictly monitor the moods and actions of the Tatar intelligentsia and instilling in them a sense of fear of being accused of nationalist survivals. A series of resolutions of the Tatar Regional Committee of the Communist Party, inspired from above by campaigns to expose the political myopia of Tatar historians, forced the authors of the manuscript “History of the Tatar ASSR” to return to the text again and again, to rewrite sections on the history of independent Tatar states in the past, their folklore and literary heritage, Jadidism, etc. It took two decades before rea­ders saw a textbook on the history of the Tatar people.

Luca Pasqualini, Gianluca Amato, Marco Fantozzi et al.

In the last years, the DeepMind algorithm AlphaZero has become the state of the art to efficiently tackle perfect information two-player zero-sum games with a win/lose outcome. However, when the win/lose outcome is decided by a final score difference, AlphaZero may play score-suboptimal moves because all winning final positions are equivalent from the win/lose outcome perspective. This can be an issue, for instance when used for teaching, or when trying to understand whether there is a better move. Moreover, there is the theoretical quest for the perfect game. A naive approach would be training an AlphaZero-like agent to predict score differences instead of win/lose outcomes. Since the game of Go is deterministic, this should as well produce an outcome-optimal play. However, it is a folklore belief that "this does not work". In this paper, we first provide empirical evidence for this belief. We then give a theoretical interpretation of this suboptimality in general perfect information two-player zero-sum game where the complexity of a game like Go is replaced by the randomness of the environment. We show that an outcome-optimal policy has a different preference for uncertainty when it is winning or losing. In particular, when in a losing state, an outcome-optimal agent chooses actions leading to a higher score variance. We then posit that when approximation is involved, a deterministic game behaves like a nondeterministic game, where the score variance is modeled by how uncertain the position is. We validate this hypothesis in AlphaZero-like software with a human expert.

M. U. Monraev

Alchiki (dice) game is an ancient folk game of nomadic peoples. It was known throughout Eurasia from the Atlantic to the Pacific Ocean, from the Kola Peninsula to Asia Minor. This folk game was extremely popular among the pastoral peoples of Eurasia, as well as in the Caucasus, in Central Asia. It was played mainly by children and youth, but also by adult men, while women rarely took part in this folk fun. There are suggestions that the game comes from a rite that appeared during the period of domestication of animals. The game inventory of folk children’s fun consisted of a large number of articular bones of small animals, the agreed number of which the players knocked out with a special bone (a bat). The dice that fell on the winning side were taken by the winner. The subject of the research is the Kalmyk folk game of alchiki. The purpose of the study is to study the existence of this game among the nomadic Kalmyk people, to analyze the variants of the game among the Mongolian peoples. The research materials were the historical and ethnographic works of Russian scientists, folklore collections, and the author’s field notes. At present, the folk game of alchiki is not so well known among the current younger generation. The active popularization of this folk game among children and youth will be another effective step in the revival of the national culture of the Kalmyks.

Nir Bitansky, Iftach Haitner, Ilan Komargodski et al.

Distributional collision resistance is a relaxation of collision resistance that only requires that it is hard to sample a collision $(x,y)$ where $x$ is uniformly random and $y$ is uniformly random conditioned on colliding with $x$. The notion lies between one-wayness and collision resistance, but its exact power is still not well-understood. On one hand, distributional collision resistant hash functions cannot be built from one-way functions in a black-box way, which may suggest that they are stronger. On the other hand, so far, they have not yielded any applications beyond one-way functions. Assuming distributional collision resistant hash functions, we construct \emph{constant-round} statistically hiding commitment scheme. Such commitments are not known based on one-way functions and are impossible to obtain from one-way functions in a black-box way. Our construction relies on the reduction from inaccessible entropy generators to statistically hiding commitments by Haitner et al.\ (STOC '09). In the converse direction, we show that two-message statistically hiding commitments imply distributional collision resistance, thereby establishing a loose equivalence between the two notions. A corollary of the first result is that constant-round statistically hiding commitments are implied by average-case hardness in the class $SZK$ (which is known to imply distributional collision resistance). This implication seems to be folklore, but to the best of our knowledge has not been proven explicitly. We provide yet another proof of this implication, which is arguably more direct than the one going through distributional collision resistance.

Alaa Maalouf, Ibrahim Jubran, Dan Feldman

A \emph{strong coreset} for the mean queries of a set $P$ in ${\mathbb{R}}^d$ is a small weighted subset $C\subseteq P$, which provably approximates its sum of squared distances to any center (point) $x\in {\mathbb{R}}^d$. A \emph{weak coreset} is (also) a small weighted subset $C$ of $P$, whose mean approximates the mean of $P$. While computing the mean of $P$ can be easily computed in linear time, its coreset can be used to solve harder constrained version, and is in the heart of generalizations such as coresets for $k$-means clustering. In this paper, we survey most of the mean coreset construction techniques, and suggest a unified analysis methodology for providing and explaining classical and modern results including step-by-step proofs. In particular, we collected folklore and scattered related results, some of which are not formally stated elsewhere. Throughout this survey, we present, explain, and prove a set of techniques, reductions, and algorithms very widespread and crucial in this field. However, when put to use in the (relatively simple) mean problem, such techniques are much simpler to grasp. The survey may help guide new researchers unfamiliar with the field, and introduce them to the very basic foundations of coresets, through a simple, yet fundamental, problem. Experts in this area might appreciate the unified analysis flow, and the comparison table for existing results. Finally, to encourage and help practitioners and software engineers, we provide full open source code for all presented algorithms.

Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams

Approximating the graph diameter is a basic task of both theoretical and practical interest. A simple folklore algorithm can output a 2-approximation to the diameter in linear time by running BFS from an arbitrary vertex. It has been open whether a better approximation is possible in near-linear time. A series of papers on fine-grained complexity have led to strong hardness results for diameter in directed graphs, culminating in a recent tradeoff curve independently discovered by [Li, STOC'21] and [Dalirrooyfard and Wein, STOC'21], showing that under the Strong Exponential Time Hypothesis (SETH), for any integer $k\ge 2$ and $δ>0$, a $2-\frac{1}{k}-δ$ approximation for diameter in directed $m$-edge graphs requires $mn^{1+1/(k-1)-o(1)}$ time. In particular, the simple linear time $2$-approximation algorithm is optimal for directed graphs. In this paper we prove that the same tradeoff lower bound curve is possible for undirected graphs as well, extending results of [Roditty and Vassilevska W., STOC'13], [Li'20] and [Bonnet, ICALP'21] who proved the first few cases of the curve, $k=2,3$ and $4$, respectively. Our result shows in particular that the simple linear time $2$-approximation algorithm is also optimal for undirected graphs. To obtain our result we develop new tools for fine-grained reductions that could be useful for proving SETH-based hardness for other problems in undirected graphs related to distance computation.

Jerry Li, Allen Liu

We consider the problem of clustering mixtures of mean-separated Gaussians in high dimensions. We are given samples from a mixture of $k$ identity covariance Gaussians, so that the minimum pairwise distance between any two pairs of means is at least $Δ$, for some parameter $Δ> 0$, and the goal is to recover the ground truth clustering of these samples. It is folklore that separation $Δ= Θ(\sqrt{\log k})$ is both necessary and sufficient to recover a good clustering, at least information theoretically. However, the estimators which achieve this guarantee are inefficient. We give the first algorithm which runs in polynomial time, and which almost matches this guarantee. More precisely, we give an algorithm which takes polynomially many samples and time, and which can successfully recover a good clustering, so long as the separation is $Δ= Ω(\log^{1/2 + c} k)$, for any $c > 0$. Previously, polynomial time algorithms were only known for this problem when the separation was polynomial in $k$, and all algorithms which could tolerate $\textsf{poly}( \log k )$ separation required quasipolynomial time. We also extend our result to mixtures of translations of a distribution which satisfies the Poincaré inequality, under additional mild assumptions. Our main technical tool, which we believe is of independent interest, is a novel way to implicitly represent and estimate high degree moments of a distribution, which allows us to extract important information about high-degree moments without ever writing down the full moment tensors explicitly.

A. F. Koryakina

The article is devoted to the identification of typological similarities and differences in epic plots and motives in the texts of the Yakut olonkho and the Buryat uliger. The relevance of the stated problem is due to the purpose of obtaining additional materials to confirm the results of earlier studies on establishing the genetic origins and typological connections of the epic creativity of the Yakut and Buryat peoples. A brief review of the study of the problem in the works of domestic folklorists, who developed the theory of the comparative study of the peoples of the world epics; Yakut epic scholars, who considered in their works the historical and typological connections of the Yakut olonkho with the epics of the Sayan-Altai, Mongol-Buryat peoples; Buryat scientists who turn in their research to the processes of historical and cultural mutual influences of the epic heritage of the Yakuts and Mongol-Buryats. Scientific methods of typological, structural-comparative and textological analysis are used. The similarity of the plots and plot motives of the olonkho “Nyurgun Bootur the Swift” by K. Orosin and the uliger “Abai Geser Mighty” by M. Imegenov, which is due to the principles of typological repetition in folklore and cultural and historical contacts of the Yakut and Buryat peoples at different stages of development of the Proto-Turkic peoples inhabiting the territory of Central Asia and South Siberia.

Torri, Davide

his paper takes into account ideas about landscape and environment as they emerge from the study of beliefs, mythology and ritual activities of religious specialists of the Himalayan region, showing a deep and enduring web of relational entanglements between human and other-than-human communities. The notion of persoonhood seems, in fact, to transcend the human dimension in order to include a wider and larger set of other-than-human communities, including mountains, waters, plants, animals and other classes of beings.

Marina T. Gogoleva, Lyudmila S. Tutukarova

Interest in the research topic arose as a result of studying the texts of folklore prose of the Yakuts and Telengits. Used method, i.e. reliance on scientific works, collection of facts, comparative analysis of lexical-semantic parallels led to interesting results. The identified samples from the folklore of peoples separated by a huge distance and an independent history of development indicate the presence of common roots. Legends reflect the peculiarities of the ideological ideas of ethnic groups, spiritual and moral values, religious views; at the same time, commonality is found not only in the lexico-semantic plan, but also in the compositional structure of the presentation of the material and the syntax of texts. The changes are quite insignificant, for example, in the Yakut version of the legend «Dispute» the image of a large animal is transformed in accordance with the realities of the Arctic nature, for example, a camel turns into an elk. The thematic approach to the consideration of examples allows us to come to the conclusion that most of the coincidences fall on the texts of religious and everyday content. Some examples from onomastics also speak of ancient linguistic contacts or testify to migration processes among the Turkic-speaking ethnic groups, which have not yet received proper coverage in historical science. In the conclusion of the article, it is said about the need to attract more extensive material to the comparative historical study of the phenomenon. Based on the comprehension of the collected material, an assumption is made about the stability of individual lexemes and lexical-semantic constructions in the translation of the traditional beliefs of the people.

Andrzej Lech