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

Nuno Lindoso

O presente artigo analisa três sequências do filme Odnajdy notchiu, de modo a investigar o grau de adesão do diretor Boris Barnet aos ditames do “cinema para milhões” – conjunto de regras de forma e conteúdo que passou a guiar a produção cinematográfica soviética a partir da segunda metade da década de 1930 para alinhar os filmes às demandas impostas pelo Realismo Socialista.

Molham Aref, Paolo Guagliardo, George Kastrinis et al.

From the moment of their inception, languages for relational data have been described as sublanguages embedded in a host programming language. Rel is a new relational language whose key design goal is to go beyond this paradigm with features that allow for programming in the large, making it possible to fully describe end to end application semantics. With the new approach we can model the semantics of entire enterprise applications relationally, which helps significantly reduce architecture complexity and avoid the well-known impedance mismatch problem. This paradigm shift is enabled by 50 years of database research, making it possible to revisit the sublanguage/host language paradigm, starting from the fundamental principles. We present the main features of Rel: those that give it the power to express traditional query language operations and those that are designed to grow the language and allow programming in the large.

Katsuhiko Hayashi, Hidetaka Kamigaito

We prove that all standard subregular language classes are linearly separable when represented by their deciding predicates. This establishes finite observability and guarantees learnability with simple linear models. Synthetic experiments confirm perfect separability under noise-free conditions, while real-data experiments on English morphology show that learned features align with well-known linguistic constraints. These results demonstrate that the subregular hierarchy provides a rigorous and interpretable foundation for modeling natural language structure. Our code used in real-data experiments is available at https://github.com/UTokyo-HayashiLab/subregular.

Aleksander Boruch-Gruszecki, Yangtian Zi, Zixuan Wu et al.

Large language models (LLMs) already excel at writing code in high-resource languages such as Python and JavaScript, yet stumble on low-resource languages that remain essential to science and engineering. Besides the obvious shortage of pre-training data, post-training itself is a bottleneck: every new language seems to require new datasets, test harnesses, and reinforcement-learning (RL) infrastructure. We introduce Agnostics, a language-agnostic post-training pipeline that eliminates this per-language engineering. The key idea is to judge code solely by its externally observable behavior, so a single verifier can test solutions written in any language. Concretely, we (i) use an LLM to rewrite existing unit-test datasets into an I/O format, (ii) supply a short configuration that tells the verifier how to compile and run a target language, and (iii) apply reinforcement learning with verifiable rewards (RLVR) in a robust code execution environment. Applied to five low-resource languages--Lua, Julia, R, OCaml, and Fortran--Agnostics (1) improves Qwen-3 4B to performance that rivals other 16B-70B open-weight models; (2) scales cleanly to larger and diverse model families (Qwen-3 8B, DeepSeek Coder 6.7B Instruct, Phi 4 Mini); and (3) for ${\le} 16$B parameter models, sets new state-of-the-art pass@1 results on MultiPL-E and a new multi-language version of LiveCodeBench that we introduce. We release the language-agnostic training datasets (Ag-MBPP-X, Ag-Codeforces-X, Ag-LiveCodeBench-X), training code, and ready-to-use configurations, making RL post-training in any programming language as simple as editing a short YAML file.

Anna Bondaruk

On the Existential Use of the Verb Brakować ‘to Lack’ in Polish This paper examines existential sentences with the verb brakować ‘to lack’ in Polish. We argue that these clauses are semantically equivalent to negative existential clauses with być ‘to be’, which follows from the fact that brakować ‘to lack’ is lexically negative. Despite the fact that brakować ‘to lack’ appears with a genitive DP, it licenses not the genitive of negation but the genitive of intentionality. The structure of existential clauses with brakować ‘to lack’ differs from that of negative existential clauses with być ‘to be’ but resembles the structure of affirmative być ‘to be’ existential clauses. Both być ‘to be’ and brakować ‘to lack’ are treated as monadic predicates whose sole argument is a small clause, represented as PredP. They only differ in the type of complement the Pred head takes: a DP in być ‘to be’ existential clauses, and an Intentional Phrase in brakować ‘to lack’ existential sentences that is responsible for assigning genitive.   Egzystencjalne użycie czasownika brakować w języku polskim W artykule analizowane są zdania egzystencjalne z czasownikiem brakować w języku polskim. Przedstawione są argumenty za tym, że zdania te semantycznie odpowiadają przeczącym zdaniom egzystencjalnym z być, co wynika z faktu, że brakować jest przeczące w warstwie leksykalnej. Mimo tego, że brakować występuje z DP w dopełniaczu, nie licencjonuje ono dopełniacza negacji, tylko dopełniacz intencjonalności. Struktura zdań egzystencjalnych z brakować różni się od struktury przeczących zdań egzystencjalnych z być, a przypomina strukturę twierdzących zdań egzystencjalnych z być. Zarówno być, jak i brakować są traktowane jako predykaty jednoargumentowe, których jednym argumentem jest struktura predykatywna PredP. Różnią się od siebie jedynie typem dopełnienia Pred, które odpowiada DP w zdaniach egzystencjalnych z być oraz frazie intencjonalności w zdaniach egzystencjalnych z brakować, odpowiedzialnej za przypisywanie dopełniacza.

Vytautas Kardelis

-

Oksana Samusenko

The paper deals with the issue of foreign language teaching methodology. It presents a question of motivating foreign students to intensify their speech activity while learning the Ukrainian language. The author’s principal focus is on the role of motivational tasks in the formation of foreign-language communicative competence, as well as in building professional and social skills by a foreign audience. Results of the conducted research confirmed the usefulness of creating such motivational tasks, based on cross-cultural sources, for foreign students of humanities. Said motivational tasks include open-type creative assignments that are based on the previously received phonetic, lexical and grammar skills and encourage learners to speak out using the Ukrainian language. This article provides models of communication situations, role-playing games, presentations, discussions, projects and some other creative oral and written exercises based on materials about life in Kyiv. The conclusions on the results of the integration of these tasks into the educational process are subsequently presented.

Edvards Seliška

Raksta mērķis ir, balstoties uz pieejamajiem publicētiem un nepublicētiem materiāliem, izsekot nodokļu politikas attīstībai un tās efektivitātei Inflantijā. Šis jautājums ir cieši saistīts ar vietējās muižniecības jeb šļahtas reālajiem ienākumiem un vojevodistes potenciālu kopumā. Šļahta faktiski kontrolēja, cik lieli nodokļi tai jāmaksā, tādējādi slēpjot īstos ienākumus. Tomēr pēc Staņislava Augusta kāpšanas Žečpospoļitas tronī 1764. gadā notika finanšu reformas, un šajā procesā piedalījās arī vietējie Inflantijas šļahtas pārstāvji, tā nodrošinot patiesāku informāciju par Inflantijas potenciālu. Līdz ar Polijas pirmo dalīšanu (1772. gadā) jaunā Krievijas vara veica īpašumu lustrāciju, sniedzot visprecīzāko priekšstatu par 18. gadsimta Inflantiju un norādot, ka, iespējams, tā ir bijusi turīgāka, nekā uzrādīja maksājamie nodokļi. No vienas puses, Inflantija 18. gadsimtā bija militāri neaizsargāta, gadsimta sākumā cietusi karos, no otras puses, tā bija demogrāfiski plaukstoša province ar nelielu šļahtas slāni, kur preču tranzīts, kroģēšana un zemes iznomāšana bija nozīmīgs ienākumu avots.

Ziyang Li, Jiani Huang, Mayur Naik

We present Scallop, a language which combines the benefits of deep learning and logical reasoning. Scallop enables users to write a wide range of neurosymbolic applications and train them in a data- and compute-efficient manner. It achieves these goals through three key features: 1) a flexible symbolic representation that is based on the relational data model; 2) a declarative logic programming language that is based on Datalog and supports recursion, aggregation, and negation; and 3) a framework for automatic and efficient differentiable reasoning that is based on the theory of provenance semirings. We evaluate Scallop on a suite of eight neurosymbolic applications from the literature. Our evaluation demonstrates that Scallop is capable of expressing algorithmic reasoning in diverse and challenging AI tasks, provides a succinct interface for machine learning programmers to integrate logical domain knowledge, and yields solutions that are comparable or superior to state-of-the-art models in terms of accuracy. Furthermore, Scallop's solutions outperform these models in aspects such as runtime and data efficiency, interpretability, and generalizability.

Thomas B. Rolinger, Christopher D. Krieger, Alan Sussman

Irregular memory access patterns pose performance and user productivity challenges on distributed-memory systems. They can lead to fine-grained remote communication and the data access patterns are often not known until runtime. The Partitioned Global Address Space (PGAS) programming model addresses these challenges by providing users with a view of a distributed-memory system that resembles a single shared address space. However, this view often leads programmers to write code that causes fine-grained remote communication, which can result in poor performance. Prior work has shown that the performance of irregular applications written in Chapel, a high-level PGAS language, can be improved by manually applying optimizations. However, applying such optimizations by hand reduces the productivity advantages provided by Chapel and the PGAS model. We present an inspector-executor based compiler optimization for Chapel programs that automatically performs remote data replication. While there have been similar compiler optimizations implemented for other PGAS languages, high-level features in Chapel such as implicit processor affinity lead to new challenges for compiler optimization. We evaluate the performance of our optimization across two irregular applications. Our results show that the total runtime can be improved by as much as 52x on a Cray XC system with a low-latency interconnect and 364x on a standard Linux cluster with an Infiniband interconnect, demonstrating that significant performance gains can be achieved without sacrificing user productivity.

Krystyna Rutkowska

This article discusses an important type of public communication taking place in Lithuania – internet blogs written in Polish. The study presents how they function, outlines the reasons behind their creation, and analyses the topics which they concern. As this is a sphere of uncontrolled communication, the author makes an attempt to present various social attitudes and to analyse subjective opinions on cultural and identity issues. The linguistic ways of expressing them are also an equally important issue. In this study, we assume that the sphere of the internet, although so far little explored, can be a very good basis for research on the way ethnic identities are shaped. The analysis of the genres of texts posted on blogs or social networking sites indicates that they are characterised by rhetorical coherence, enter into various relationships with each other, creating a blogosphere, and have a dialogical nature. They are usually written in a general language with regional accretions. A frequent phenomenon is using these features as the hallmark of a group, a factor integrating the internet community. Due to the fact that the authors of these websites are usually young people, a common phenomenon is the colloquial linguistic marking of statements, striving to exaggerate certain events, using stylistically marked lexis. We are dealing here with the colloquial style preserved in the written version.

Željka Fink

U suvremenom se hrvatskom jeziku aktivno rabi desetak glagolskih frazema čije se značenje odnosi na verbalne napade. Osnovna se tema rada odnosi na frazeme baciti / bacati (sasuti i sl.) drvlje i kamenje <na koga, na što>, bacati se (nabacivati se i sl.) drvljem i kamenjem na koga, na što, zasuti drvljem i kamenjem koga, što (‘verbalno napasti / napadati koga, što’) koji svoje porijeklo vuku iz drevnog običaja kamenovanja prestupnika osuđenih na smrt. Potpuni su frazemski ekvivalenti zabilježeni u srpskom i makedonskom jeziku, dok se u drugim slavenskim jezicima upotrebljavaju semantički ekvivalenti

Amir Shaikhha, Mathieu Huot, Shabnam Ghasemirad et al.

Automatic differentiation (AD) is a technique for computing the derivative of a function represented by a program. This technique is considered as the de-facto standard for computing the differentiation in many machine learning and optimisation software tools. Despite the practicality of this technique, the performance of the differentiated programs, especially for functional languages and in the presence of vectors, is suboptimal. We present an AD system for a higher-order functional array-processing language. The core functional language underlying this system simultaneously supports both source-to-source forward-mode AD and global optimisations such as loop transformations. In combination, gradient computation with forward-mode AD can be as efficient as reverse mode, and the Jacobian matrices required for numerical algorithms such as Gauss-Newton and Levenberg-Marquardt can be efficiently computed.

Bjørn Kjos-Hanssen

Let $A_N$ denote nondeterministic automatic complexity and \[ L_{k,c}=\{x\in [k]^* : A_N(x)> |x|/c\}. \] In particular, $L_{k,2}$ is the language of all $k$-ary words for which $A_N$ is maximal, while $L_{k,3}$ gives a rough dividing line between complex and simple. Let $\mathbf{CFL}$ denote the complexity class consisting of all context-free languages. While it is not known that $L_{2,2}$ is infinite, Kjos-Hanssen (2017) showed that $L_{3,2}$ is $\mathbf{CFL}$-immune but not $\mathbf{coCFL}$-immune. We complete the picture by showing that $L_{3,2}\not\in\mathbf{coCFL}$. Turning to Boolean circuit complexity, we show that $L_{2,3}$ is $\mathbf{SAC}^0$-immune and $\mathbf{SAC}^0$-coimmune. Here $\mathbf{SAC}^0$ denotes the complexity class consisting of all languages computed by (non-uniform) constant-depth circuits with semi-unbounded fanin. As for arithmetic circuits, we show that $\{x:A_N(x)>1\}\not\in\oplus\mathbf{SAC}^0$. In particular, $\mathbf{SAC}^0\not\subseteq\oplus \mathbf{SAC}^0$, which resolves an open implication from the Complexity Zoo.

Wilmer Ricciotti, James Cheney

Language-integrated query based on comprehension syntax is a powerful technique for safe database programming, and provides a basis for advanced techniques such as query shredding or query flattening that allow efficient programming with complex nested collections. However, the foundations of these techniques are lacking: although SQL, the most widely-used database query language, supports heterogeneous queries that mix set and multiset semantics, these important capabilities are not supported by known correctness results or implementations that assume homogeneous collections. In this paper we study language-integrated query for a heterogeneous query language $NRC_λ(Set,Bag)$ that combines set and multiset constructs. We show how to normalize and translate queries to SQL, and develop a novel approach to querying heterogeneous nested collections, based on the insight that ``local'' query subexpressions that calculate nested subcollections can be ``lifted'' to the top level analogously to lambda-lifting for local function definitions.

Dana Baláková, Viera Kováčová, Валерий Михайлович Мокиенко

Povod in navdih za študijo, ki se osredotoča na vprašanje biblijske frazeologije, temelji na povezavi med biblijskimi frazemi in izhodiščnim besedilom. Odnos frazemov do tega izho­dišča se kaže v raziskovalnem smislu zelo specifično – skozi prizmo odsevanja v določenem kulturno-jezikovnem okolju ter v jezikovnem občutku sodobnih uporabnikov določenega jezika. Na podlagi izsledkov sociolingvistične raziskave, ki je bila opravljena v ruskem kul­turno-jezikovnem okolju, avtorji iščejo odgovor na vprašanje, ki spada tudi v širšo jezikovno razgledanost: v kolikšni meri se sodobni uporabniki (ruskega) jezika zavedajo povezave med izbrano množico frazemov in biblijskimi besedili.

Лариса [Larysa] Іванівна [Ivanivna] Шевченко [Shevchenko], Дмитро [Dmytro] Юрійович [IUriĭovych] Сизонов [Syzonov]

The State and Prospects of Discursive-Stylistic Lexicography: An Overview This article presents a general analysis of traditional and new lexicography. In doing so, it argues for the relevance of discursive-stylistic theoretical approaches and practices in compiling innovative dictionaries. Using the example of Ukrainian and Polish media dictionaries, the authors describe the evolutionary process of transition from print to electronic (computer) dictionaries, and from descriptive to analytical ones. A survey they conducted among students of the Taras Shevchenko National University of Kyiv confirms this process: 84% of the respondents preferred using new dictionaries based on computer technologies. The authors note that the trends observed in Polish and Ukrainian media lexicography are logical in the context of the development of world lexicography. In order to confirm this, they provide an overview of American, German and British media dictionaries. They also describe new Ukrainian dictionaries of the discursive type (e.g. Medialinhvistyka: Slovnyk terminiv i poniatʹ [Media Linguistics: A Dictionary of Terms and Concepts] by Larysa Shevchenko, Dmytro Derhach and Dmytro Syzonov, 2014) and the frequency type (e.g. Novi slova ta frazeolohizmy v ukrains′kykh media: Slovnyk [A Dictionary of New Words and Phraseologisms in the Ukrainian Mass Media] by Larysa Shevchenko and Dmytro Syzonov, 2017). The dictionaries are discussed in the context of the development of Ukrainian lexicography and its interrelation with current European, particularly Polish, lexicographic tendencies. The authors plan to continue developing multimedia dictionaries, focusing in particular on collecting media material and its computer processing. The aim of this work is to expand and further organise a dataset for new dictionaries of the twenty-first century, guided by the discursive-stylistic theoretical approach.   Stan i perspektywy leksykografii dyskursywno‑stylistycznej: przegląd problemu Artykuł przedstawia ogólną analizę leksykografii tradycyjnej i nowej, uzasadniając przy tym istotność dyskursywno-stylistycznych podejść i praktyk teoretycznych w tworzeniu innowacyjnych słowników. Na przykładzie ukraińskich i polskich słowników medialnych opisuje ewolucyjny proces przejścia od słowników drukowanych do elektronicznych (komputerowych) i od słowników opisowych do analitycznych. Ankieta przeprowadzona przez autorów wśrod studentów Kijowskiego Uniwersytetu Narodowego im. Tarasa Szewczenki potwierdza zachodzenie tego procesu: 84% respondentów woli korzystać z nowoczesnych słowników opartych na technologii komputerowej. Autorzy zauważają, że trendy obserwowane w polskiej i ukraińskiej leksykografii medialnej są logiczne w kontekście rozwoju leksykografii światowej, co potwierdza przegląd słowników z USA, Niemiec i Wielkiej Brytanii. Opisane zostały także ukraińskie neosłowniki – typu dyskursywnego (np. Медіалінгвістика: Словник термінів і понять [Media-lingwistyka: Słownik terminów i pojęć] Łarysy Szewczenko, Dmytra Derhacza i Dmytra Syzonowa, 2014) oraz frekwencyjnego (np. Нові слова та фразеологізми в українських медіа: Словник [Nowe słowa i idiomy w ukraińskich mediach: Słownik] Łarysy Szewczenko i Dmytra Syzonowa, 2017). Słowniki te omówiono w kontekście rozwoju ukraińskiej leksykografii i jej relacji ze współczesnymi europejskimi, a szczególnie polskimi, trendami leksykograficznymi. Autorzy planują dalsze prace nad nowoczesnymi słownikami multimedialnymi, w szczególności gromadzenie materiału medialnego i jego przetwarzanie komputerowe. Celem tej pracy naukowej jest dalsza rozbudowa elektronicznej kartoteki, która posłuży za podstawę nowych, dyskursywno-stylistycznych słowników XXI wieku.

Vincenzo De Florio, Chris Blondia

When programming resource-scarce embedded smart devices, the designer often requires both the low-level system programming features of a language such as C and higher level capability typical of a language like Java. The choice of a particular language typically implies trade offs between conflicting design goals such as performance, costs, and overheads. The large variety of languages, virtual machines, and translators provides the designer with a dense trade off space, ranging from minimalistic to rich full-fledged approaches, but once a choice is made it is often difficult for the designer to revise it. In this work we propose a system of light-weighted and modular extensions as a method to flexibly reshape the target programming language as needed, adding only those application layer features that match the current design goals. In so doing complexity is made transparent, but not hidden: While the programmer can benefit of higher level constructs, the designer can deal with modular building blocks each characterized by a certain algorithmic complexity and therefore each accountable for a given share of the overhead. As a result the designer is given a finer control on the amount of resources that are consumed by the run-time executive of the chosen programming language.

Sándor Bartha, James Cheney

We introduce a new application for inductive logic programming: learning the semantics of programming languages from example evaluations. In this short paper, we explored a simplified task in this domain using the Metagol meta-interpretive learning system. We highlighted the challenging aspects of this scenario, including abstracting over function symbols, nonterminating examples, and learning non-observed predicates, and proposed extensions to Metagol helpful for overcoming these challenges, which may prove useful in other domains.

Augusto Modanese

After an apparent hiatus of roughly 30 years, we revisit a seemingly neglected subject in the theory of (one-dimensional) cellular automata: sublinear-time computation. The model considered is that of ACAs, which are language acceptors whose acceptance condition depends on the states of all cells in the automaton. We prove a time hierarchy theorem for sublinear-time ACA classes, analyze their intersection with the regular languages, and, finally, establish strict inclusions in the parallel computation classes $\mathsf{SC}$ and (uniform) $\mathsf{AC}$. As an addendum, we introduce and investigate the concept of a decider ACA (DACA) as a candidate for a decider counterpart to (acceptor) ACAs. We show the class of languages decidable in constant time by DACAs equals the locally testable languages, and we also determine $Ω(\sqrt{n})$ as the (tight) time complexity threshold for DACAs up to which no advantage compared to constant time is possible.