Hasil untuk "Slavic languages. Baltic languages. Albanian languages"

Giovanni Pighizzini

A turn in a computation of a pushdown automaton is a switch from a phase in which the height of the pushdown store increases to a phase in which it decreases. Given a pushdown or one-counter automaton, we consider, for each string in its language, the minimum number of turns made in accepting computations. We prove that it cannot be decided if this number is bounded by any constants. Furthermore, we obtain a non-recursive trade-off between pushdown and one-counter automata accepting in a finite number of turns and finite-turn pushdown automata, that are defined requiring that the constant bound is satisfied by each accepting computation. We prove that there are languages accepted in a sublinear but not constant number of turns, with respect to the input length. Furthermore, there exists an infinite proper hierarchy of complexity classes, with the number of turns bounded by different sublinear functions. In addition, there is a language requiring a number of turns which is not constant but grows slower than each of the functions defining the above hierarchy.

Stephen M. Dickey

It is argued that the phonetic coalescence of *sъ- and *jьz into a single prefix resulted in the (partial) grammaticalization of innovative s-/z- as the primary préverbe vide of the aspectual systems in a group of western languages (Czech, Slovak, Sorbian, Slovene). The other Slavic languages either did not grammaticalize a single prefix (Croatian/Serbian) or have grammaticalized po- as their sole or primary préverbe vide (Russian, Bulgarian, Macedonian, Ukrainian, Belarusian); one Slavic language has near equal productivity of s-/z- and po- (Polish).

A. G. Nesterov, E. O. Muslimova

This study examines the development of transregional relationships between the Special Administrative Region of the People's Republic of China, Macao, and various countries and regions in Europe. It argues that Macao possesses unique rights that enable the region to engage in independent international activities within economic and cultural domains. The findings indicate that Macao is currently focused on diversifying its economy and expanding its potential international partnerships, particularly through cooperation with Lusophone countries and regions. While collaboration with European regions remains relatively limited, it is noteworthy in terms of economic partnerships with the federal states of Germany and traditional ties with Portugal. The research highlights that a key element of Macao's cultural policy and international cultural cooperation is Lusophony, which involves the promotion and dissemination of the Portuguese language and culture — a historical legacy that continues to evolve within the framework of the Community of Portuguese Language Countries. Furthermore, it reveals that Macao is actively seeking to enhance its connections with European regions, particularly in the economic, cultural, and educational sectors. The current government of Macao plays a significant role in this initiative, enjoying full support from the central government of the People’s Republic of China.

Nripesh Niketan, Vaatsalya Shrivastva

We present CrossTL, a universal programming language translator enabling bidirectional translation between multiple languages through a unified intermediate representation called CrossGL. Traditional approaches require separate translators for each language pair, leading to exponential complexity growth. CrossTL uses a single universal IR to facilitate translations between CUDA, HIP, Metal, DirectX HLSL, OpenGL GLSL, Vulkan SPIR-V, Rust, and Mojo, with Slang support in development. Our system consists of: language-specific lexers/parsers converting source code to ASTs, bidirectional CrossGL translation modules implementing ToCrossGLConverter classes for importing code and CodeGen classes for target generation, and comprehensive backend implementations handling full translation pipelines. We demonstrate effectiveness through comprehensive evaluation across programming domains, achieving successful compilation and execution across all supported backends. The universal IR design enables adding new languages with minimal effort, requiring only language-specific frontend/backend components. Our contributions include: (1) a unified IR capturing semantics of multiple programming paradigms, (2) a modular architecture enabling extensibility, (3) a comprehensive framework supporting GPU compute, graphics programming, and systems languages, and (4) empirical validation demonstrating practical viability of universal code translation. CrossTL represents a significant step toward language-agnostic programming, enabling write-once, deploy-everywhere development.

Kayo Tei, Haruto Mishina, Naoki Yamamoto et al.

Systematic discovery of optimization paths in quantum circuit simplification remains a challenge. Today, ZX-calculus, a computing model for quantum circuit transformation, is attracting attention for its highly abstract graph-based approach. Whereas existing tools such as PyZX and Quantomatic offer domain-specific support for quantum circuit optimization, visualization and theorem-proving, we present a complementary approach using LMNtal, a general-purpose hierarchical graph rewriting language, to establish a diagrammatic transformation and verification platform with model checking. Our methodology shows three advantages: (1) manipulation of ZX-diagrams through native graph transformation rules, enabling direct implementation of basic rules; (2) quantified pattern matching via QLMNtal extensions, greatly simplifying rule specification; and (3) interactive visualization and validation of optimization paths through state space exploration. Through case studies, we demonstrate how our framework helps understand optimization paths and design new algorithms and strategies. This suggests that the declarative language LMNtal and its toolchain could serve as a new platform to investigate quantum circuit transformation from a different perspective.

Dorota Klimek-Jankowska, Alberto Frasson, Piotr Gulgowski

This study examines variation in the use and interpretation of the perfective (pfv) aspect in negated past tense contexts across East Slavic and selected West and Southwest Slavic languages. Unlike West and Southwest Slavic, where the pfv + neg in past tense contexts allows for an interpretation denying the existence of the event at any past time, East Slavic uniquely interprets the pfv aspect in these contexts as indicating that the agent either planned but failed to realize the event or initiated it but failed to complete it. We account for this by assuming that negation operates either high (¬TP), as sentential negation, or low (¬vP), over the event domain. In East Slavic, the interaction of the pfv aspect with the past tense prevents high negation and enforces low negation, resulting in inhibited event reading. This reading implies that the event was expected or initiated but ultimately unrealized. We argue that the semantics of the pfv aspect in East Slavic parallels the semantics of specific indefinites in the nominal domain. The aspect head introduces a temporal variable t, which, via a choice function, restricts the domain of existential quantification over t to a singleton set, presupposing the existence of t, which cannot be canceled by high negation. Consequently, in negated pfv past tense contexts in East Slavic, negation scopes over the event domain giving rise to special interpretative constraints in past tense perfective contexts with negation.

Pierre Gonneau

Giuseppe Castagna, Loïc Peyrot

We define and study "row polymorphism" for a type system with set-theoretic types, specifically union, intersection, and negation types. We consider record types that embed row variables and define a subtyping relation by interpreting types into sets of record values and by defining subtyping as the containment of interpretations. We define a functional calculus equipped with operations for field extension, selection, and deletion, its operational semantics, and a type system that we prove to be sound. We provide algorithms for deciding the typing and subtyping relations. This research is motivated by the current trend of defining static type system for dynamic languages and, in our case, by an ongoing effort of endowing the Elixir programming language with a gradual type system.

Ashmal Vayani, Dinura Dissanayake, Hasindri Watawana et al.

Existing Large Multimodal Models (LMMs) generally focus on only a few regions and languages. As LMMs continue to improve, it is increasingly important to ensure they understand cultural contexts, respect local sensitivities, and support low-resource languages, all while effectively integrating corresponding visual cues. In pursuit of culturally diverse global multimodal models, our proposed All Languages Matter Benchmark (ALM-bench) represents the largest and most comprehensive effort to date for evaluating LMMs across 100 languages. ALM-bench challenges existing models by testing their ability to understand and reason about culturally diverse images paired with text in various languages, including many low-resource languages traditionally underrepresented in LMM research. The benchmark offers a robust and nuanced evaluation framework featuring various question formats, including true/false, multiple choice, and open-ended questions, which are further divided into short and long-answer categories. ALM-bench design ensures a comprehensive assessment of a model's ability to handle varied levels of difficulty in visual and linguistic reasoning. To capture the rich tapestry of global cultures, ALM-bench carefully curates content from 13 distinct cultural aspects, ranging from traditions and rituals to famous personalities and celebrations. Through this, ALM-bench not only provides a rigorous testing ground for state-of-the-art open and closed-source LMMs but also highlights the importance of cultural and linguistic inclusivity, encouraging the development of models that can serve diverse global populations effectively. Our benchmark is publicly available.

Hansi Hettiarachchi, Tharindu Ranasinghe, Paul Rayson et al.

The first Workshop on Language Models for Low-Resource Languages (LoResLM 2025) was held in conjunction with the 31st International Conference on Computational Linguistics (COLING 2025) in Abu Dhabi, United Arab Emirates. This workshop mainly aimed to provide a forum for researchers to share and discuss their ongoing work on language models (LMs) focusing on low-resource languages, following the recent advancements in neural language models and their linguistic biases towards high-resource languages. LoResLM 2025 attracted notable interest from the natural language processing (NLP) community, resulting in 35 accepted papers from 52 submissions. These contributions cover a broad range of low-resource languages from eight language families and 13 diverse research areas, paving the way for future possibilities and promoting linguistic inclusivity in NLP.

Andrew Blinn, Xiang Li, June Hyung Kim et al.

Large language models (LLMs) have reshaped the landscape of program synthesis. However, contemporary LLM-based code completion systems often hallucinate broken code because they lack appropriate context, particularly when working with definitions not in the training data nor near the cursor. This paper demonstrates that tight integration with the type and binding structure of a language, as exposed by its language server, can address this contextualization problem in a token-efficient manner. In short, we contend that AIs need IDEs, too! In particular, we integrate LLM code generation into the Hazel live program sketching environment. The Hazel Language Server identifies the type and typing context of the hole being filled, even in the presence of errors, ensuring that a meaningful program sketch is always available. This allows prompting with codebase-wide contextual information not lexically local to the cursor, nor necessarily in the same file, but that is likely to be semantically local to the developer's goal. Completions synthesized by the LLM are then iteratively refined via further dialog with the language server. To evaluate these techniques, we introduce MVUBench, a dataset of model-view-update (MVU) web applications. These applications serve as challenge problems due to their reliance on application-specific data structures. We find that contextualization with type definitions is particularly impactful. After introducing our ideas in the context of Hazel we duplicate our techniques and port MVUBench to TypeScript in order to validate the applicability of these methods to higher-resource languages. Finally, we outline ChatLSP, a conservative extension to the Language Server Protocol (LSP) that language servers can implement to expose capabilities that AI code completion systems of various designs can use to incorporate static context when generating prompts for an LLM.

Alberto Ciaffaglione, Carlos Olarte

Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last two decades. This workshop brings together designers, implementors and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressiveness and lucidity of the reasoning process.

Giuseppe Castagna, Mickaël Laurent, Kim Nguyen

We present a type system that combines, in a controlled way, first-order polymorphism with intersectiontypes, union types, and subtyping, and prove its safety. We then define a type reconstruction algorithm that issound and terminating. This yields a system in which unannotated functions are given polymorphic types(thanks to Hindley-Milner) that can express the overloaded behavior of the functions they type (thanks tothe intersection introduction rule) and that are deduced by applying advanced techniques of type narrowing(thanks to the union elimination rule). This makes the system a prime candidate to type dynamic languages.

Daniel Lundén, Lars Hummelgren, Jan Kudlicka et al.

Universal probabilistic programming languages (PPLs) make it relatively easy to encode and automatically solve statistical inference problems. To solve inference problems, PPL implementations often apply Monte Carlo inference algorithms that rely on execution suspension. State-of-the-art solutions enable execution suspension either through (i) continuation-passing style (CPS) transformations or (ii) efficient, but comparatively complex, low-level solutions that are often not available in high-level languages. CPS transformations introduce overhead due to unnecessary closure allocations -- a problem the PPL community has generally overlooked. To reduce overhead, we develop a new efficient selective CPS approach for PPLs. Specifically, we design a novel static suspension analysis technique that determines parts of programs that require suspension, given a particular inference algorithm. The analysis allows selectively CPS transforming the program only where necessary. We formally prove the correctness of the analysis and implement the analysis and transformation in the Miking CorePPL compiler. We evaluate the implementation for a large number of Monte Carlo inference algorithms on real-world models from phylogenetics, epidemiology, and topic modeling. The evaluation results demonstrate significant improvements across all models and inference algorithms.

Лидия Танушевска

Проект NEWSLA — это проект, получивший поддержку программы ERASMUS MUNDUS. Включает в себя универсальную подготовку современной формы второй ступени высшего образования по славистике, подготовлен тремя университетами (Силезский университет в Катовицах, Остравский университет в Остраве, Университет имени Св. Кирилла и Мефодия в Скопье). Программа обучения, разрабатываемая в рамках этого проекта, будет содержать также курс на тему «Город в литературе и культуре» этих трех стран, охватывающий следующие темы: город как центр мира, город как мифологическое место, геокультурная символика города, феномен «потерянных» городов, отношение человека к городу, фланирование или искусство прогулки по городу и город как переводческая проблема. В статье представлены различные аспекты и примеры из указанной программы обучения. Статья поступила в редакцию 17.01.2022. Цитирование Танушевска Л. Топос города — широкое поле для создания курса лекций в рамках проекта NEWSLA // Славянский альманах. 2022. No 1–2. С. 293–303. DOI: 10.31168/2073-5731.2022.1-2.3.06

Roman Fisun

A. Dybo

Marko Prelevikj, Slavko Žitnik

Anastasia Bauer

Abstract:This paper gives a comprehensive overview of how impersonalization is expressed in Slavic. It presents the results of a comparative corpus study, outlining all possible strategies for expressing impersonalization in six Slavic languages (Russian, Ukrainian, Bulgarian, Croatian, Czech, and Polish), using German man as a filter. This paper shows on the basis of a random sample of over 5,000 translated sentences which impersonalization means Slavic languages use to express propositional content expressed by the pronoun man in German. Additionally, this pilot study answers two questions: (1) How do Slavic languages differ in the distribution of these impersonalization strategies? and (2) Are there major translation effects? The main findings are an outline of a cross-Slavic set of impersonalization strategies that reveals significant differences between the Slavic languages in the distribution of man-equivalents and a highly significant impact of the source language on the choice of the impersonalization strategy in translation.

E. V. Dziuba, Yu. V. Rogozinnikova

The article analyzes precedent anthroponyms of the Soviet origin in multimodal texts of American and British advertising. The study aims at analyzing precedent anthroponyms of the Soviet origin in English multimodal texts from the linguoaxiological and linguopragmatic points of view and from the standpoint of textual organization. The following research methods have been used: description and synthesis, linguistic methods of structural-semantic, contextual and cognitive-discourse analysis. The paper examines the precedent names of the Soviet origin (for instance, Lenin, Stalin, Brezhnev, Gorbachev, Yeltsin, and Kalashnikov). It also establishes their uses in commercial texts and highlights the linguistic means of satirical effect creation as the main pragmatic goal of English commercial and social advertising. The name of a political leader acquires different connotations and in most cases it is “demoted” due to the transfer of the name from the political context to the everyday one: gastronomic, material, kitsch-cultural, glamorous-erotic, etc. Names of the Soviet politicians are found in advertisements of cigarettes, pizza, alcoholic and nonalcoholic drinks, bags and other household items, including absorbent wipes. The article concludes that the image of the Soviet past in multimodal advertising texts in English acquires negative connotations. Besides, the analyzed texts emphasize that the communist ideology belongs to the system of anti-values.