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

E. A. Salikhova

This study investigates the textual content of two online treasure hunting groups from a communicative-pragmatic and socio-psycholinguistic perspective. It examines how specific linguistic features function within these texts, including polymodal text, semantically depleted language units, implicatures, and others. Fifty posts with accompanying images as well as ten video publications from participants' web pages were analyzed for each group representing Bashkortostan and Orenburg regions. The study introduces data on implicit meanings that are activated through both textual and polymodal communication means. Comparative analysis between the online communities of Bashkortostan and Orenburg is presented. Additionally, attention is given to speech activity theory, which allows us to consider audience-directed information based on the communicator's intention and their chosen methods — verbal or audiovisual — for presenting this information across social networks. In light of increased virtual interaction, the object of scientific inquiry becomes discursive text, influencing various perceptual channels among group members. The conclusion emphasizes that pragmatic strategies used by internet-based treasure hunting communities create certain behavioral models due to their reliance on pragmalinguistic tools.

Martina Kolar Billege

Deset godina nakon uspostave standarda početnoga pisanja, standardizacije školskih slova u <i>Hrvatskom pravopisu</i> Instituta za hrvatski jezik i jezikoslovlje (2013) i implementacije školskih slova u kurikul, udžbenike i nastavu u Republici Hrvatskoj, daje se pregled relevantnih znanstvenih istraživanja za rano poučavanje pisanja na hrvatskome jeziku te se identificira stanje početne pisane produkcije učenika u primarnome obrazovanju. S ciljem praćenja implementacije standarda početnoga pisanja, istražili smo primjenu metodičkih smjernica za držanje ruke, tijela i pisaljke pri početnom poučavanju pisanja u prvome razredu primarnoga obrazovanja te broj riječi u leksičkom asociogramu na temu ‘djetinjstva’ učenika četvrtoga razreda. Na temelju leksičkoga asociograma identificirali smo broj pogrešaka u pisanju ovisno o vrsti slova te narušenost čitljivosti. Rezultati pokazuju da manje od 50 % učenika prvoga razreda (N = 606) pravilno drži olovku i ruku pri pisanju, ali u većem postotnom udjelu (70 %) pravilno drže tijelo. Učitelji izjavljuju da uvijek upućuju učenike na pravilno držanje ruke i pisaljke te na pravilan smjer pisanja slova i vrlo rijetko dopuštaju odstupanje od smjera pisanja i zadanog izgleda školskoga slova. Unatoč tome, identificirana je narušena čitljivost kod 34,4 % učenika četvrtoga razreda (N = 356) koji su pisali rukopisnim slovima.

Franciszek Piszcz

There is a vast gap in the quality of IDE tooling between static languages like Java and dynamic languages like Python or JavaScript. Modern frameworks and libraries in these languages heavily use their dynamic capabilities to achieve the best ergonomics and readability. This has a side effect of making the current generation of IDEs blind to control flow and data flow, which often breaks navigation, autocompletion and refactoring. In this thesis we propose an algorithm that can bridge this gap between tooling for dynamic and static languages by statically analyzing dynamic metaprogramming and runtime reflection in programs. We use a technique called abstract interpretation to partially execute programs and extract information that is usually only available at runtime. Our algorithm has been implemented in a prototype analyzer that can analyze programs written in a subset of JavaScript.

Mike Cruchten

Automata operating on pairs of words were introduced as an alternative way of capturing acceptance of regular $ω$-languages. Families of DFAs and lasso automata operating on such pairs followed, giving rise to minimisation algorithms, a Myhill-Nerode theorem and language learning algorithms. Yet Kleene theorems for such a well-established class are still missing. We introduce rational lasso languages and expressions, show a Kleene theorem for lasso languages and explore the connection between rational lasso and $ω$-expressions, which yields a Kleene theorem for $ω$-languages with respect to saturated lasso automata. For one direction of the Kleene theorems, we also provide a Brzozowski construction for lasso automata from rational lasso expressions.

Rūta Šlapkauskaitė

-

Paulina Pycia-Košća, Nikola Košćak

This paper analyzes the Croatian translation of Dorota Masłowska’s Polish novel Wojna polsko-ruska pod flagą biało-czerwoną. The aim of the research is to analyze the translation solutions on the lexical, syntactic and stylistic level, on the level of intertextual and popular culture references, and check the degree of equivalence between the source and target text.

Oscar H. Ibarra, Ian McQuillan

Techniques are developed for creating new and general language families of only semilinear languages, and for showing families only contain semilinear languages. It is shown that for language families L that are semilinear full trios, the smallest full AFL containing L that is also closed under intersection with languages in NCM (where NCM is the family of languages accepted by NFAs augmented with reversal-bounded counters), is also semilinear. If these closure properties are effective, this also immediately implies decidability of membership, emptiness, and infiniteness for these general families. From the general techniques, new grammar systems are given that are extensions of well-known families of semilinear full trios, whereby it is implied that these extensions must only describe semilinear languages. This also implies positive decidability properties for the new systems. Some characterizations of the new families are also given.

Helena Dobrovoljc

V prispevku so predstavljena nazorska nasprotja pri usmerjanju knjižne slovenščine, ki se kažejo v neenotnih podatkih v priročnikih knjižnega jezika. Opisana so generacijska in nazorska nesoglasja glede ugotavljanja normativne osnove sodobnemu knjižnemu jeziku in metode, ki zagotavljajo poenotenje jezikoslovcev, ki ob posodabljanju knjižnojezikovne norme upoštevajo tako jezikovno dinamiko kot potrebe skupnosti.

Stefan Hoffmann

We investigate the state complexity of the upward and downward closure and interior operations on commutative regular languages. Then, we systematically study the state complexity of these operations and of the shuffle operation on commutative group languages and commutative aperiodic (or star-free) languages.

Katarzyna Konczewska

Język polski na Kresach [Polish Language in the Eastern Borderlands] by Janusz Rieger Against the Background of Research on Borderland Polish After 2015 This article presents the state of research in the field of studies on Borderland Polish after 2015. The author provides an overview of selected publications which concern the situation of the Polish language in Belarus, Lithuania, Ukraine and in the borderlands, discusses the issues and research problems they consider, and outlines the main areas of research. The article focuses on the contribution of Janusz Rieger to this field of study and on his latest monograph: Język polski na Kresach [The Polish Language in the Eastern Borderlands], published in 2019   Język polski na Kresach Janusza Riegera na tle badań nad polszczyzną kresową po roku 2015 Artykuł przedstawia stan badań nad polszczyzną kresową po 2015 roku. Autorka dokonuje przeglądu wybranych pozycji traktujących o języku polskim na Litwie, Białorusi i Ukrainie oraz pograniczach, omawia przedstawione w publikacjach problemy i wątki badawcze, prezentuje kierunki eksploracji. Oddzielna uwaga została poświęcona dokonaniom w dziedzinie badań nad polszczyzną kresową Janusza Riegera, a także jego najnowszej monografii z 2019 roku pt. Język polski na Kresach.

Olga A. Senatorova

The article continues studying interconnected teaching of Russian language and culture in linguistic and сultural aspect of the methodology of teaching Russian as a foreign language (RFL) from the perspective of communicative and active learning. The relevance of this study is associated with the need to develop a system of theoretical and practical recommendations on using cultural potential of language environment in teaching and learning RFL as part of communicative and active approach to teaching. The research attempts to develop the concept and content of a coursebook on linguocultural studies, aimed at extending knowledge of Russian culture and developing communicative competence of foreigners studying the Russian language. This is an important condition for linguocultural adaptation. The research was carried out on the basis of traditional folk culture realities, which most vividly reflect the peculiarities of national mentality and provide opportunities for both theoretical and practical cultural activities in teaching/learning RFL: decorative and applied art and folk crafts, traditional folk dolls, and cuisine. The methods of the research are analysis, generalization and forecasting. The research resulted in developing the concept of a coursebook on linguocultural studies and determining its content. The author makes conclusion about effectiveness of the communicative-activity approach in teaching and learning aimed at extending foreigners knowledge about Russian culture and Russian national mentality, forming their communicative competence and providing successful linguistic and cultural adaptation. The conclusion is based on the materials of a coursebook on linguistic and cultural studies for foreigners learning Russian.

Leonardo Masi

Tatiana Bottineau

The functioning of značit exceeds the framework of a syntactic connection. In correlation with the meaning of its base, značit as a discursive marker works at the enunciative level. It constitutes the trace of the implicit mental operations and constructs an opposition of view points on an existing situation. The aim of the discursive analysis of značit is a description of its semantic variation and the expression of the speaker’s position on the existing situation.

Jorge C. Lucero, Sławek Staworko

An F-system is a computational model that performs a folding operation on words of a given language, following directions coded on words of another given language. This paper considers the case in which both given languages are regular, and it shows that the class of languages generated by such F-systems is a proper subset of the class of linear context-free languages.

Rita Gitik, Eliyahy Rips

We prove that the closure of the one-sided Dyck language in a free monoid is a two-sided Dyck language.

Mirac Suzgun, Sebastian Gehrmann, Yonatan Belinkov et al.

In this paper, we systematically assess the ability of standard recurrent networks to perform dynamic counting and to encode hierarchical representations. All the neural models in our experiments are designed to be small-sized networks both to prevent them from memorizing the training sets and to visualize and interpret their behaviour at test time. Our results demonstrate that the Long Short-Term Memory (LSTM) networks can learn to recognize the well-balanced parenthesis language (Dyck-$1$) and the shuffles of multiple Dyck-$1$ languages, each defined over different parenthesis-pairs, by emulating simple real-time $k$-counter machines. To the best of our knowledge, this work is the first study to introduce the shuffle languages to analyze the computational power of neural networks. We also show that a single-layer LSTM with only one hidden unit is practically sufficient for recognizing the Dyck-$1$ language. However, none of our recurrent networks was able to yield a good performance on the Dyck-$2$ language learning task, which requires a model to have a stack-like mechanism for recognition.

Corwin Sinnamon

A language L is suffix-convex if for any words u, v,w, whenever w and uvw are in L, vw is in L as well. Suffix-convex languages include left ideals, suffix-closed languages, and suffix-free languages, which were studied previously. In this paper, we concentrate on suffix-convex languages that do not belong to any one of these classes; we call such languages proper. In order to study this language class, we define a structure called a suffix-convex triple system that characterizes the automata recognizing suffix-convex languages. We find tight upper bounds for reversal, star, product, and boolean operations of proper suffix-convex languages, and we conjecture on the size of the largest syntactic semigroup. We also prove that three witness streams are required to meet all these bounds.

Stefan Marr, Carmen Torres Lopez, Dominik Aumayr et al.

Today's complex software systems combine high-level concurrency models. Each model is used to solve a specific set of problems. Unfortunately, debuggers support only the low-level notions of threads and shared memory, forcing developers to reason about these notions instead of the high-level concurrency models they chose. This paper proposes a concurrency-agnostic debugger protocol that decouples the debugger from the concurrency models employed by the target application. As a result, the underlying language runtime can define custom breakpoints, stepping operations, and execution events for each concurrency model it supports, and a debugger can expose them without having to be specifically adapted. We evaluated the generality of the protocol by applying it to SOMns, a Newspeak implementation, which supports a diversity of concurrency models including communicating sequential processes, communicating event loops, threads and locks, fork/join parallelism, and software transactional memory. We implemented 21 breakpoints and 20 stepping operations for these concurrency models. For none of these, the debugger needed to be changed. Furthermore, we visualize all concurrent interactions independently of a specific concurrency model. To show that tooling for a specific concurrency model is possible, we visualize actor turns and message sends separately.

Alexander Sakharov

We present a method for approximating context-free languages with one-counter automata. This approximation allows the reconstruction of parse trees of the original grammar. We identify a decidable superset of regular languages whose elements, i.e. languages, are recognized by one-counter automata.

Tomáš Masopust

Piecewise testable languages form the first level of the Straubing-Thérien hierarchy. The membership problem for this level is decidable and testing if the language of a DFA is piecewise testable is NL-complete. The question has not yet been addressed for NFAs. We fill in this gap by showing that it is PSpace-complete. The main result is then the lower-bound complexity of separability of regular languages by piecewise testable languages. Two regular languages are separable by a piecewise testable language if the piecewise testable language includes one of them and is disjoint from the other. For languages represented by NFAs, separability by piecewise testable languages is known to be decidable in PTime. We show that it is PTime-hard and that it remains PTime-hard even for minimal DFAs.