Готові списки джерел за темами / Minimal Recursion Semantic / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Minimal Recursion Semantic.

Статті в журналах з теми "Minimal Recursion Semantic"

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-23 статей у журналах для дослідження на тему "Minimal Recursion Semantic".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

Jørgensen, Fredrik, and Jan Tore Lønning. "A Minimal Recursion Semantic Analysis of Locatives." Computational Linguistics 35, no. 2 (June 2009): 229–70. http://dx.doi.org/10.1162/coli.06-69-prep5.

Повний текст джерела

Анотація:

The article describes a pilot implementation of a grammar containing different types of locative PPs. In particular, we investigate the distinction between static and directional locatives, and between different types of directional locatives. Locatives may act as modifiers as well as referring expressions depending on the syntactic context. We handle this with a single lexical entry. The implementation is of Norwegian locatives, but English locatives are both discussed and compared to Norwegian locatives. The semantic analysis is based on a proposal by Markus Kracht (2002), and we show how this analysis can be incorporated into Minimal Recursion Semantics (MRS) (Copestake et al. 2005). We discuss how the resulting system may be applied in a transfer-based machine translation system, and how we can map from a shallow MRS representation to a deeper semantic representation.

Стилі APA, Harvard, Vancouver, ISO та ін.

Manshadi, Mehdi, Daniel Gildea, and James F. Allen. "A Notion of Semantic Coherence for Underspecified Semantic Representation." Computational Linguistics 44, no. 1 (March 2018): 39–83. http://dx.doi.org/10.1162/coli_a_00307.

Повний текст джерела

Анотація:

The general problem of finding satisfying solutions to constraint-based underspecified representations of quantifier scope is NP-complete. Existing frameworks, including Dominance Graphs, Minimal Recursion Semantics, and Hole Semantics, have struggled to balance expressivity and tractability in order to cover real natural language sentences with efficient algorithms. We address this trade-off with a general principle of coherence, which requires that every variable introduced in the domain of discourse must contribute to the overall semantics of the sentence. We show that every underspecified representation meeting this criterion can be efficiently processed, and that our set of representations subsumes all previously identified tractable sets.

Стилі APA, Harvard, Vancouver, ISO та ін.

Simov, Kiril, and Petya Osenova. "Special Thematic Section on Semantic Models for Natural Language Processing (Preface)." Cybernetics and Information Technologies 18, no. 1 (March 1, 2018): 93–94. http://dx.doi.org/10.2478/cait-2018-0008.

Повний текст джерела

Анотація:

Abstract With the availability of large language data online, cross-linked lexical resources (such as BabelNet, Predicate Matrix and UBY) and semantically annotated corpora (SemCor, OntoNotes, etc.), more and more applications in Natural Language Processing (NLP) have started to exploit various semantic models. The semantic models have been created on the base of LSA, clustering, word embeddings, deep learning, neural networks, etc., and abstract logical forms, such as Minimal Recursion Semantics (MRS) or Abstract Meaning Representation (AMR), etc. Additionally, the Linguistic Linked Open Data Cloud has been initiated (LLOD Cloud) which interlinks linguistic data for improving the tasks of NLP. This cloud has been expanding enormously for the last four-five years. It includes corpora, lexicons, thesauri, knowledge bases of various kinds, organized around appropriate ontologies, such as LEMON. The semantic models behind the data organization as well as the representation of the semantic resources themselves are a challenge to the NLP community. The NLP applications that extensively rely on the above discussed models include Machine Translation, Information Extraction, Question Answering, Text Simplification, etc.

Стилі APA, Harvard, Vancouver, ISO та ін.

Yao, Xuchen, Gosse Bouma, and Yi Zhang. "Semantics-based Question Generation and Implementation." Dialogue & Discourse 3, no. 2 (March 16, 2012): 11–42. http://dx.doi.org/10.5087/dad.2012.202.

Повний текст джерела

Анотація:

This paper presents a question generation system based on the approach of semantic rewriting. The state-of-the-art deep linguistic parsing and generation tools are employed to convert (back and forth) between the natural language sentences and their meaning representations in the form of Minimal Recursion Semantics (MRS). By carefully operating on the semantic structures, we show a principled way of generating questions without ad-hoc manipulation of the syntactic structures. Based on the (partial) understanding of the sentence meaning, the system generates questions which are semantically grounded and purposeful. And with the support of deep linguistic grammars, the grammaticality of the generation results is warranted. Further, with a specialized ranking model, the linguistic realizations from the general purpose generation model are further refined for our the question generation task. The evaluation results from QGSTEC2010 show promising prospects of the proposed approach.

Стилі APA, Harvard, Vancouver, ISO та ін.

Xu, Yang, Emmy Liu, and Terry Regier. "Numeral Systems Across Languages Support Efficient Communication: From Approximate Numerosity to Recursion." Open Mind 4 (August 2020): 57–70. http://dx.doi.org/10.1162/opmi_a_00034.

Повний текст джерела

Анотація:

Languages differ qualitatively in their numeral systems. At one extreme, some languages have a small set of number terms, which denote approximate or inexact numerosities; at the other extreme, many languages have forms for exact numerosities over a very large range, through a recursively defined counting system. Why do numeral systems vary as they do? Here, we use computational analyses to explore the numeral systems of 30 languages that span this spectrum. We find that these numeral systems all reflect a functional need for efficient communication, mirroring existing arguments in other semantic domains such as color, kinship, and space. Our findings suggest that cross-language variation in numeral systems may be understood in terms of a shared functional need to communicate precisely while using minimal cognitive resources.

Стилі APA, Harvard, Vancouver, ISO та ін.

Copestake, Ann, Dan Flickinger, Carl Pollard, and Ivan A. Sag. "Minimal Recursion Semantics: An Introduction." Research on Language and Computation 3, no. 2-3 (July 2005): 281–332. http://dx.doi.org/10.1007/s11168-006-6327-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Egg, M. "Wh-questions in underspecified minimal recursion semantics." Journal of Semantics 15, no. 1 (February 1, 1998): 37–82. http://dx.doi.org/10.1093/jos/15.1.37.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

TSUIKI, HIDEKI. "A computationally adequate model for overloading via domain-valued functors." Mathematical Structures in Computer Science 8, no. 4 (August 1998): 321–49. http://dx.doi.org/10.1017/s0960129598002539.

Повний текст джерела

Анотація:

We give a denotational semantics to a calculus λ[otimes ] with overloading and subtyping. In λ[otimes ], the interaction between overloading and subtyping causes self application, and non-normalizing terms exist for each type. Moreover, the semantics of a type depends not on that type alone, but also on infinitely many others. Thus, we need to consider infinitely many domains, which are related by an infinite number of mutually recursive equations. We solve this by considering a functor category from the poset of types modulo equivalence to a category in which each type is interpreted. We introduce a categorical constructor corresponding to overloading, and formalize the equations as a single equation in the functor category. A semantics of λ[otimes ] is then expressed in terms of the minimal solution of this equation. We prove the adequacy theorem for λ[otimes ] following the construction in Pitts (1994) and use it to derive some syntactic properties.

Стилі APA, Harvard, Vancouver, ISO та ін.

CROLE, ROY L., and ANDREW D. GORDON. "Relating operational and denotational semantics for input/output effects." Mathematical Structures in Computer Science 9, no. 2 (April 1999): 125–58. http://dx.doi.org/10.1017/s0960129598002709.

Повний текст джерела

Анотація:

We study the longstanding problem of semantics for input/output (I/O) expressed using side-effects. Our vehicle is a small higher-order imperative language, with operations for interactive character I/O and based on ML syntax. Unlike previous theories, we present both operational and denotational semantics for I/O effects. We use a novel labelled transition system that uniformly expresses both applicative and imperative computation. We make a standard definition of bisimilarity and prove bisimilarity is a congruence using Howe's method.Next, we define a metalanguage [Mscr ] in which we may give a denotational semantics to [Oscr ]. [Mscr ] generalises Crole and Pitts' FIX-logic by adding in a parameterised recursive datatype, which is used to model I/O. [Mscr ] comes equipped both with an operational semantics and a domain-theoretic semantics in the category [Cscr ][Pscr ][Pscr ][Oscr ] of cppos (bottom-pointed posets with joins of ω-chains) and Scott continuous functions. We use the [Cscr ][Pscr ][Pscr ][Oscr ] semantics to prove that [Mscr ] is computationally adequate for the operational semantics using formal approximation relations. The existence of such relations is based on recent work of Pitts (Pitts 1994b) for untyped languages, and uses the idea of minimal invariant objects due to Freyd.A monadic-style textual translation into [Mscr ] induces a denotational semantics on [Oscr ]. Our final result validates the denotational semantics: if the denotations of two [Oscr ] programs are equal, then the [Oscr ] programs are in fact operationally equivalent.

Стилі APA, Harvard, Vancouver, ISO та ін.

Prokopaki-Kostopoulou, Nefeli, and Stasinos Konstantopoulos. "Optimizing within-distance queries by approximating shapes with maximal bounded boxes." Open Research Europe 2 (May 9, 2022): 57. http://dx.doi.org/10.12688/openreseurope.14321.1.

Повний текст джерела

Анотація:

Background: In geospatial query processing, spatial containment and intersection queries can be efficiently answered from the index. There is, however, a class of queries (such as within-distance) with a semantics that implies that every shape in the database is a potential match and should, in principle, be compared with the threshold. Naturally, this is impractical and optimizations have been developed that efficiently refine the set of candidate shapes before starting to actually compute distances and apply the threshold. In the case of the within-distance queries, many instances can be discarded in advance as too distant. Since geospatial databases organize data as a hierarchy of bounding boxes, this already provided the first direct optimization as the actual distance cannot be smaller than the distance between the bounding boxes. One can easily understand that there are shape configurations that give bounding boxes that are not very selective for near-by shapes. That is, configurations where there are shapes outside the requested distance but within the request distance from the bounding box. Methods: In this article, we investigate a further optimization in addition to and after comparing the bounding boxes, but before computing precise distances. We describe the distance optimizer operation currently used by PostGIS and show how the existing implementation prevails over approaches that use additional approximations. We implement a recursive algorithm to calculate the minimal possible largest inner rectangles of geometries. Results: We observe that the performance of the distance operation cannot be improved by using the inner approximations instead of the actual shapes. The overheads of the inner rectangles would not be recovered from calculating the distance between simpler geometries. Conclusions: The execution time of the distance operator has a small dependence on polygon complexity. Conclusively, an inner approximation for complex polygons cannot out-perform the standard PostGIS implementation.

Стилі APA, Harvard, Vancouver, ISO та ін.

Asudeh, Ash, and Richard Crouch. "Glue semantics for HPSG." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, May 1, 2002. http://dx.doi.org/10.21248/hpsg.2001.1.

Повний текст джерела

Анотація:

‎The glue approach to semantic interpretation has been developed principally for Lexical Functional Grammar. Recent work has shown how glue can be used with a variety of syntactic theories and this paper outlines how it can be applied to HPSG. As well as providing an alternative form of semantics for HPSG, we believe that the benefits of HPSG glue include the following: (1) simplification of the Semantics Principle; (2) a simple and elegant treatment of modifier scope, including empirical phenomena like quantifier scope ambiguity, the interaction of scope with raising, and recursive modification; (3) an analysis of control that handles agreement between controlled subjects and their coarguments while allowing for a property denotation for the controlled clause; (4) re-use of highly efficient techniques for semantic derivation already implemented for LFG, and which target problems of ambiguity management also addressed by Minimal Recursion Semantics.

Стилі APA, Harvard, Vancouver, ISO та ін.

Bonami, Olivier. "syntax-semantics interface for tense and aspect in French." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, May 1, 2002. http://dx.doi.org/10.21248/hpsg.2001.3.

Повний текст джерела

Анотація:

This paper proposes an HPSG account of the French tense and aspect system, focussing on the analysis of the passé simple (simple past) and imparfait (imperfective) tenses and their interaction with aspectually sensitive adjuncts. Starting from de Swart's (1998) analysis of the semantics of tense and aspect, I show that while the proposed semantic representations are appropriate, the analysis of implicit aspectual operators as coercion operators is inadequate. The proposed HPSG analysis relies on Minimal Recursion Semantics to relate standard syntactic structures with de Swart-style semantic representations. The analysis has two crucial features: first, it assumes that the semantic contribution of tense originates in the verb's semantic representation, despite the fact that tense can get wide scope over other semantic elements. Second, it allows the occurrence of implicit aspectual operators to be controlled by the verb's inflectional class, which accounts for their peculiar distribution.

Стилі APA, Harvard, Vancouver, ISO та ін.

Crysmann, Berthold. "Underspecification of intersective modifier attachment: Some arguments from German." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, October 1, 2004. http://dx.doi.org/10.21248/hpsg.2004.21.

Повний текст джерела

Анотація:

In this paper, I shall discuss the semantic attachment of intersective modifiers in German coherent constructions. I shall show that a purely syntactic solution to the observable attachment ambiguity is undesirable for reasons of processing e ciency and/or massive spurious ambiguity. Instead, I shall follow Egg and Lebeth (1995) and propose an extension to Minimal Recursion Semantics, permitting the expression of underspecified semantic attachment. This rather trivial move, as we shall see, will not only be preferable for processing reasons, but it will also be more in line with the spirit of underspecified semantics, e ectively providing a compact representation of purely semantic distinctions, instead of unfolding these distinctions into a rain forest of tree representations and derivations. I will present an implementation of the underspecification approach integrated into the German HPSG developed at DFKI and compare its e ciency to an alternative implementation where semantic attachment is unfolded by means of retrieval rules.

Стилі APA, Harvard, Vancouver, ISO та ін.

Flouraki, Maria. "Constraining aspectual composition." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, October 12, 2006. http://dx.doi.org/10.21248/hpsg.2006.8.

Повний текст джерела

Анотація:

In Modern Greek there is a rich aspectual system, which involves both morphologically expressed grammatical aspect and eventuality types, carried primarily by the meaning of the verbal predicate. Particular emphasis is paid to the interaction between grammatical aspect and eventuality types, since it is due to this interaction that the verbal predicate acquires distinct meanings. In order to explain potential changes in the meaning of the eventualities caused by the interaction with grammatical aspect, I propose a formal analysis within HPSG, using Minimal Recursion Semantics (MRS) for the semantic representations. Following the MRS architecture, I introduce a number of relations, which represent both grammatical aspect and eventuality types. The close interaction between grammatical aspect and eventuality types triggers special meanings which traditionally can be explained by inserting contextual information into the representations. In this paper, I argue against such an analysis, providing an alternative which is based on the introduction of subeventual templates formulated by Michaelis (2003) and Pustejovsky (1995). In this context, grammatical aspect combines with eventuality types and selects eventualities or subeventualities appropriate to its selection restrictions, using information that is already there in the denotation of the eventualities.

Стилі APA, Harvard, Vancouver, ISO та ін.

Frank, Anette, Kathrin Spreyer, Witold Drożdżyński, Hans-Ulrich Krieger, and Ulrich Schäfer. "Constraint-based RMRS construction from shallow grammars." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, October 1, 2004. http://dx.doi.org/10.21248/hpsg.2004.22.

Повний текст джерела

Анотація:

We present a constraint-based syntax-semantics interface for the construction of RMRS (Robust Minimal Recursion Semantics) representations from shallow grammars. The architecture is designed to allow modular interfaces to existing shallow grammars of various depth - ranging from chunk grammars to context-free stochastic grammars. We define modular semantics construction principles in a typed feature structure formalism that allow flexible adaptation to alternative grammars and different languages.

Стилі APA, Harvard, Vancouver, ISO та ін.

Beermann, Dorothee, and Lars Hellan. "A treatment of directionals in implemented HPSG grammars." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, October 1, 2004. http://dx.doi.org/10.21248/hpsg.2004.20.

Повний текст джерела

Анотація:

This article proposes a semantics of directional expressions in Norwegian and German, regarded as VP modifiers. The analysis uses Minimal Recursion Semantics, as an integrated part of Matrix-based HPSG grammars. Directional expressions are analyzed as modifying an individual, the 'mover'. Context dependent directionals like here receive a decomposed analysis. Telicity values reflecting various types of directional and locative expressions are computed.

Стилі APA, Harvard, Vancouver, ISO та ін.

Sio, Joanna Ut-Seong, and Sanghoun Song. "Divergence in expressing definiteness between Mandarin and Cantonese." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, October 15, 2015. http://dx.doi.org/10.21248/hpsg.2015.11.

Повний текст джерела

Анотація:

In this paper, we model the dialectal variation in the expression of definiteness in Mandarin and Cantonese adopting the Head-Driven Phrase Structure Grammar (HPSG) framework (Pollard & Sag, 1994) and Minimal Recursion Semantics (MRS) (Copestake et al., 2005).

Стилі APA, Harvard, Vancouver, ISO та ін.

HO, WENG KIN. "An operational domain-theoretic treatment of recursive types." Mathematical Structures in Computer Science 24, no. 1 (March 19, 2013). http://dx.doi.org/10.1017/s0960129512001004.

Повний текст джерела

Анотація:

We develop an operational domain theory for treating recursive types with respect to contextual equivalence. The principal approach we take deviates from classical domain theory in that we do not produce the recursive types using the usual inverse limits constructions – we get them for free by working directly with the operational semantics. By extending type expressions to functors between some ‘syntactic’ categories, we establish algebraic compactness. To do this, we rely on an operational version of the minimal invariance property, for which we give a purely operational proof.

Стилі APA, Harvard, Vancouver, ISO та ін.

Moeljadi, David, and Francis Bond. "HPSG analysis and computational implementation of Indonesian passives." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, October 15, 2018. http://dx.doi.org/10.21248/hpsg.2018.8.

Повний текст джерела

Анотація:

This study aims to analyze and develop a detailed model of syntax and semantics of passive sentences in standard Indonesian in the framework of Head-Driven Phrase Structure Grammar (HPSG) (Pollard & Sag, 1994; Sag et al., 2003) and Minimal Recursion Semantics (MRS) (Copestake et al., 2005), explicit enough to be interpreted by a computer, focusing on implementation rather than theory. There are two main types of passive in Indonesian, following Sneddon et al. (2010, pp. 256-260) and Alwi et al. (2014, pp. 352-356), called ‘passive type 1’ (P1) and ‘passive type 2’ (P2). Both types were analyzed and implemented in the Indonesian Resource Grammar (INDRA), a computational grammar for Indonesian (Moeljadi et al., 2015).

Стилі APA, Harvard, Vancouver, ISO та ін.

Kordoni, Valia. "Between shifts and alternations: Ditransitive constructions." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, October 25, 2004. http://dx.doi.org/10.21248/hpsg.2004.9.

Повний текст джерела

Анотація:

In this paper I present two classes of double object constructions in Modern Greek, i.e., the genitive, as well as the double accusative, ditransitive constructions. I show that these two classes differ from one another in that not both of them permit derivational processes such as the formation of adjectival passives. I also look at the case properties associated with the verbs which head Modern Greek genitive and double accusative ditransitive constructions. Finally, the analysis I propose for these constructions in Modern Greek are formalized using the Minimal Recursion Semantics (MRS) framework of Copestake et al. (2001) and Copestake et al. (2003).

Стилі APA, Harvard, Vancouver, ISO та ін.

BRANDT, JÖRGEN, WOLFGANG REISIG, and ULF LESER. "Computation semantics of the functional scientific workflow language Cuneiform." Journal of Functional Programming 27 (2017). http://dx.doi.org/10.1017/s0956796817000119.

Повний текст джерела

Анотація:

AbstractCuneiform is a minimal functional programming language for large-scale scientific data analysis. Implementing a strict black-box view on external operators and data, it allows the direct embedding of code in a variety of external languages like Python or R, provides data-parallel higher order operators for processing large partitioned data sets, allows conditionals and general recursion, and has a naturally parallelizable evaluation strategy suitable for multi-core servers and distributed execution environments like Hadoop, HTCondor, or distributed Erlang. Cuneiform has been applied in several data-intensive research areas including remote sensing, machine learning, and bioinformatics, all of which critically depend on the flexible assembly of pre-existing tools and libraries written in different languages into complex pipelines. This paper introduces the computation semantics for Cuneiform. It presents Cuneiform's abstract syntax, a simple type system, and the semantics of evaluation. Providing an unambiguous specification of the behavior of Cuneiform eases the implementation of interpreters which we showcase by providing a concise reference implementation in Erlang. The similarity of Cuneiform's syntax to the simply typed lambda calculus puts Cuneiform in perspective and allows a straightforward discussion of its design in the context of functional programming. Moreover, the simple type system allows the deduction of the language's safety up to black-box operators. Last, the formulation of the semantics also permits the verification of compilers to and from other workflow languages.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ørsnes, Bjarne. "Preposed negation in Danish." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, October 13, 2009. http://dx.doi.org/10.21248/hpsg.2009.13.

Повний текст джерела

Анотація:

In Danish the base position of the negation and negated quantifier phrases is between the subject and the finite verb in embedded clauses. However, in embedded clauses introduced by a non-veridical complementizer such as hvis (ˋif') or om (ˋwhether') the negation and negated quantifier phrases can also appear between the complementizer and the subject. This phenomenon is referred to as preposed negation. The paper investigates the structure and semantics of this construction. It is argued that preposed negation is no adjunction structure, but a special construction where the negation element is a sister of the complementizer and the filler of a filler-gap-structure. It is further argued that preposed negation is associated with negated verum-focus of a clause lacking an (aboutness-) topic. The negation of a verum predicate explains why preposed negation fails to license strong negative polarity items and to rule out positive ones. The lack of a topic explains why preposed negation is preferred with non-referential subjects and with weak readings of indefinite subjects and why preposed negation is incompatible with topic-binding particles.The final section presents an HPSG-analysis of preposed negation using Minimal Recursion Semantics (MRS).

Стилі APA, Harvard, Vancouver, ISO та ін.

Lee, Juwon. "The direct evidential -te in Korean: Its interaction with person and experiencer predicates." Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, October 18, 2012. http://dx.doi.org/10.21248/hpsg.2012.15.

Повний текст джерела

Анотація:

This paper discusses the complex relations among the direct evidential -te, person, and experiencer predicates in Korean. The questions of the paper are: (i) how the three components are related with each other in the evidential sentences, and (ii) how the interactions of the three components can be formally analyzed to correctly license only the well-formed evidential sentences. I show that in direct evidential construction with a non-private predicate (e.g. pwutulep- ‘soft’), the asserter/epistemic authority (i.e. the speaker na ‘I’ in declarative or the addressee ne ‘you’ in question) must be the experiencer of the predicate, but there is no such constraint in direct evidential construction with a private predicate (e.g. aphu- ‘sick’). I also show that the direct evidential construction with a non-private predicate is an instance of self-ascription. Then I propose an analysis of the experiencer predicates and associated lexical rules in the Minimal Recursion Semantics (MRS) (Copestake, et al., 2005) of Head-driven Phrase Structure Grammar (HPSG) (Pollard and Sag, 1994; Sag, et al., 2003).

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!