ФОРМАЛНО ОПИСАНИЕ НА СЛОВООБРАЗУВАТЕЛНИТЕ СТРУКТУРИ В НОРМАТИВНАТА ГРАМАТИКА НА БЪЛГАРСКИЯ ЕЗИК / FORMAL DESCRIPTION OF WORD-FORMATION STRUCTURES IN BULGARIAN NORMATIVE GRAMMAR

The paper deals with the scope of the term syntactic paradigm with a view to the syntactic description in the framework of a normative grammar of Bulgarian. The overview of the content of the term as understood by different authors shows that the proposed definitions do not satisfy the requirement for an independent description of form and content adopted as a basic principle in normative grammar. The reason for this is that scholars take as a point of departure the lexeme, an idiomatic (individual) set of word forms with an identical and regularly differentiated semantic characteristics that enter into regular oppositions. The paper offers an entirely formal understanding of the term syntactic paradigm whose applicability in the syntactic component of normative grammar is illustrated with selected subparadigms that include formal sentence structures consisting of simple endocentric syntactic constructions with verbs, prepositions and nouns. Keywords: syntactic paradigm, formal description, sentence structures, normative grammar, Bulgarian language

Students of public administration have often focused on behaviour and attitudes without relating them explicitly to bureaucratic structure. They have also concentrated on structural descriptions, and on reorganization processes. These steps are, beyond doubt, necessary and important. However, connecting structure and policy making in order to learn about the consequences of alternative arrangements can be assumed to be the ultimate concern of academics as well as of practitioners. The relationship between formal structure and actual decision behaviour is an issue of enduring theoretical interest. At the same time, insights into how organizational change might affect policy‐making and performance are crucial for most high‐level officials. I will proceed by identifying theoretical components that assign a role to the formal administrative structure in this respect. The empirical studies I draw on are mainly confined to research on central government bureaucracies at the national level, and how their structures affect substantive policy making

Structures of concepts can be described by Boolean lattices, factorial structures of attributes by splitting lattices. Generally the splitting lattices are neither distributive nor complementary. A generalization of the calculus in lattices of quantity systems enables the introduction of hierarchical structures. The relation between factorial and hierarchical attribute structures is shown. Formal hierarchical structures can be represented by semantic structures and vice versa. Often semantic structures only seem to be factorial or hierarchical. So it is necessary to differentiate strictly between formal and semantic structures.

When linguistic accounts describe the English similative construction, they tend to concentrate on its most prototypical formal variant, exemplified with the sentence Susy is like her sister. Nevertheless, linguistic data from the selected linguistic literature and The Corpus of Contemporary American English indicates many other expressions that code this construction. This paper attempts to compile and describe these expressions, grouping them into formal categories, whose semantic and formal structure is represented using the Construction Grammar formalism. Based on this formal examination, I will propose a formal taxonomy of the English similative construction, describing the taxonomic relations between higher level and lower level formal categories.

The article is dedicated to the consideration of a complex sentence from the semantic, communicative and grammatical point of view. The doctrine of a complex sentence is an important linguistic problem that needs to be finally resolved. Linguistic principles of teaching the syntax of a complex sentence are covered in the scientific theories of linguists: M Grecha, V. Beloshapkova, I. Vykhovanets, A. Grishchenko, S. Doroshenko, K. Shulzhuk and others. The study of the hierarchy of syntactic relations and semantic-syntactic relations between parts and components of a complex multicomponent sentence is important at the present stage of development of the syntax of a complex sentence. Syntax is given a central place in the grammatical system of language. The sentence is a central unit of syntax, which has long attracted the attention of scientists. Recently, problems of sentence meaning, linguistic and speech semantics have been of great interest in linguistics. Speech semantics is determined by the lexical meanings of the words that make up the sentence. There are a number of problems with sentence semantics. The semantic structure of a complex sentence has become the subject of a comprehensive study, the vast majority of linguists note the importance of studying a sentence in terms of its meaning, the interaction of semantic and formal structures. In the modern school, the concept of scientificity is determined primarily by the methodology of the science of language, which provides the formation of correct views on the material nature of the native language, its functions, the system of language, understanding the content and form of language. Only on this basis can a truly scientific school course of the Ukrainian language be created. In the educational process, the role of the native language in the formation of the student's personality is increasing. Of particular importance is the ability to independently replenish their knowledge of the language, to navigate in the rapid flow of new information.

Lexical-Functional Grammar (LFG) is a theory of generative grammar. The goal is to explain the native speaker's knowledge of language by specifying a grammar that models the speaker's knowledge explicitly and which is distinct from the computational mechanisms that constitute the language processor. This chapter is organized as follows. Section 15.2 discusses the two syntactic structures posited by LFG: constituent structure (c-structure) and functional structure (f-structure). LFG distinguishes between formal structures and structural descriptions that well-formed structures must satisfy. The structural descriptions are sets of constraints. A constraint is a statement that is either true or false of a structure. Section 15.3 provides an overview of the most important sorts of constraints. Section 17.4 explains how c-structure and f-structure are related by structural correspondences. Section 17.5 describes the Correspondence Architecture. Section 17.6 considers some recent developments in LFG.

Satisfiability of Boolean formulas (SAT) is one of the most prominent NP-complete problems. We consider k-SAT, the decision problem that asks whether formulas in conjunctive normal form (CNF) with clauses of size at most k are satisfiable, and the more general problem called (d, k)ClSP (clause satisfaction problem) where the variables are d-valued instead of Boolean. For k-SAT and (d, k)-ClSP many algorithms have been presented whose running time is “moderately exponential” in the number of variables of the input formula. One of the fastest randomized algorithm for k-SAT is the PPSZ algorithm by Paturi, Pudlak, Saks, and Zane (FOCS 1998). We re-analyze the PPSZ algorithm and show that the bounds shown in the case where the input formula has at most one satisfying assignment (Unique k-SAT) hold in general, which was previously only known for k ≥ 5. We also show how to generalize PPSZ to (d, k)-ClSP, improving on the previous algorithms for most considered values of (d, k). Furthermore, we present a new algorithm based on PPSZ with exponentially better bounds for 3-SAT. For general k we show that in order to improve on PPSZ for k-SAT, it is enough to improve on PPSZ for Unique k-SAT.

The unit of modern Russian language courses focused on semi-complex and semi-compound sentences is one of the most difficult compared to other topics. In the widely known current textbooks on syntax, this unit is usually not accompanied by a preamble that would highlight the grammatical phenomenon essence or the principles for classifying constructions related to elementary structure "complicators". Meanwhile, the very status of semi-complex and semi-compound sentences on the gradience scale from simple to composite sentence patterns remains controversial. The article aims to clarify problem areas and provide theoretical and methodological grounds that could serve as the linguo-didactic basis for a university course in the syntax of such sentences. The methodological framework of the study includes general scientific methods (analysis, synthesis, induction, deduction, comparison, observation). Moreover, the research employs procedures common to the humanities in order to describe and interpret individual phenomena, as well as modeling educational situations. The study resulted in a characterisation of the major features inherent in semi-complex and semi-compound sentences, regardless of the construction type complicating it. The hierarchical (multi-tier) formal grammatical structure, the increasing complexity of actant-predicate relations of such sentences, their "polypropositional" semantic structure and the "polyrhematic" communicative organisation caused by "additional" predicativity arising in them are associated with the formation of special, independent of word properties, two-tiered syntactic connections and relations. Rhythmic-melodic prominence with constructional optionality is the most essential feature of a complicator. Therefore, homogeneous part series duplicating the positions already present in the linear chain of the word forms which are members of the predicative centre are not complicating constructions. The same can be said about event names in the role of the main parts or secondary elements extending them. The combination of the enumerated properties leads to the conclusion that there is a close unity, rather than the usually declared heterogeneity of phenomena categorised as complicators. This article offers methodological recommendations for a university course in Russian syntax (the unit "Semi-complex and Semi-compound Sentences").

The partial string avoidability problem, also known as partial word avoidability, is stated as follows: given a finite set of strings with possible ``holes'' (undefined symbols), determine whether there exists any two-sided infinite string containing no substrings from this set, assuming that a hole matches every symbol. The problem is known to be NP-hard and in PSPACE, and this paper establishes its PSPACE-completeness. Next, string avoidability over the binary alphabet is interpreted as a version of conjunctive normal form (CNF) satisfiability problem (SAT), with each clause having infinitely many shifted variants. Non-satisfiability of these formulas can be proved using variants of classical propositional proof systems, augmented with derivation rules for shifting constraints (such as clauses, inequalities, polynomials, etc). Two results on their proof complexity are established. First, there is a particular formula that has a short refutation in Resolution with shift, but requires classical proofs of exponential size (Resolution, Cutting Plane, Polynomial Calculus, etc.). At the same time, exponential lower bounds for shifted versions of classical proof systems are established.

We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of their hypergraph structure, by associating to a CNF formula the hypergraph obtained by ignoring negations and considering clauses as hyperedges on variables. We show that satisfiability of CNF formulas with so-called ``beta-acyclic hypergraphs'' can be decided in polynomial time. We also study the parameterized complexity of SAT for ``almost'' beta-acyclic instances, using as parameter the formula's distance from being beta-acyclic. As distance we use the size of smallest strong backdoor sets and the beta-hypertree width. As a by-product we obtain the W[1]-hardness of SAT parameterized by the (undirected) clique-width of the incidence graph, which disproves a conjecture by Fischer, Makowsky, and Ravve (Discr. Appl. Math. 156, 2008).

XSAT is defined as the following: Given a propositional formula in conjunctive normal form, can one find an assignment to variables such that there is exactly only 1 literal that is true in every clause, while the other literals are false. The decision problem XSAT is known to be NP-complete. Crescenzi and Rossi [Pierluigi Crescenzi and Gianluca Rossi, 2002] introduced the variant where one searches for a pair of two solutions of an X3SAT instance with maximal Hamming Distance among them, that is, one wants to identify the largest number k such that there are two solutions of the instance with Hamming Distance k. Dahllof [Vilhelm Dahllof, 2005; Vilhelm Dahllof, 2006] provided an algorithm using branch and bound method for Max Hamming Distance XSAT in O(1.8348^n); Fu, Zhou and Yin [Linlu Fu and Minghao Yin, 2012] worked on a more specific problem, the Max Hamming Distance X3SAT, and found for this problem an algorithm with runtime O(1.6760^n). In this paper, we propose an exact exponential algorithm to solve the Max Hamming Distance XSAT problem in O(1.4983^n) time. Like all of them, we will use the branch and bound technique alongside a newly defined measure to improve the analysis of the algorithm.

The author of this article discusses the issue of defrazeologization in dementia, it means the disruptions in realization of phrasal idioms in people with early stage Alzheimer’s dementia, which manifest in transformations of their formal structure (modifying innovations) and the semantic structure (semantic modifications). These phraseological innovations should be interpreted as the unconscious modifications resulting from the progressive cognitive dysfunctions of people with dementia. The author of this work presents the preliminary results of research conducted in 2015–2017 on the group of 15 people with early stage Alzheimer’s dementia with application of authorial test of lexical and semantic skills in elderly people with dementia.

In the article the theoretical study of the formation linguistic personality of the future teacher of the primary school in the process of teaching Ukrainian syntax and compound sentence of Ukrainian language; the essence of the notions linguistic personality of the future teacher of the primary school is determined and syntactical competence; elements of methodology are described formation linguistic personality of the future teacher of the primary school. The authors of scientific research see that the teaching of syntax is carried out using a text-centric approach, which is implemented through a developed system of exercises, in which texts illustrate the cultural heritage of the Ukrainian people, its traditions, features of national identity, etc. occupy a prominent place. The lingvodidactic conditions for the formation linguistic personality of the future teacher of the primary school in the process teaching syntax of compound sentence are determined, the result of the formation depends on the usage effective forms, methods, techniques, the criteria are determined. Emphasis is placed on the levels of language personality formation (verbal–grammatical, cognitive, pragmatic). The essence of the proposed technique is to create a system of exercises and tasks (analytical, reproductive, constructive productive and creative character), to realize the textocentric approach to the formation of syntactic skills in the process of mastering phrases, simple and complex sentences. It is noted that the verbal-grammatical criterion reflects the ability of the linguistic person to build structural and justifiable syntactic structures depending on their semantic load, to correctly identify sentences, determine their stylistic functions; сognitive-realized as a skill of linguistic personality to generate, understand and perceive speech expressions depending on their formal syntactic and semantic structure, reproducing them with a holistic language picture of the world against socio-cultural processes, taking into account their own national identity; Pragmatic - indicates the skill of the linguistic person communicative-justifiable to use syntactic structures in accordance with a specific speech situation, depending on the communicative intention and purpose of communication.

This paper presents a formal model for an explicit description of the semantic structure which implicitly exists with documents. This model relies on content meaning description of document elements. Meaning representation is distributed in the overall architecture model: it binds a semantic structure, a logical structure of documents and a domain model. The semantic structure contains two levels of description: meaning representation of information units. The description logic formalism is used to represent semantics of document elements and document rhetorical organisation. This paper shows how semantic structuring of documents can be efficiently defined using SGML syntax. Using this documents structuring norm, one can define two levels of description: generic semantic structure (vs. Document Type Definition) and specific semantic structure (vs. instantiated document) in order to define an abstract interface to the information stored in documents. The medical patient record has been presented as a relevant example for handling semantic structured documents.

The study addresses the semantics of word formation from a contrastive perspective. Swedish often uses NN compounds to express combined concepts in cases where French uses lexicalized constructions or syntactic phrases. The objective is to examine Swedish NN compounds and corresponding constructions in French with regard to formal and semantic structure. A parallel corpus of Swedish and French versions of minutes from European Parliament debates has been compiled. The method consists in extracting and analysing all Swedish NN compounds (nearly 1,000) along with their French counterparts in the corpus. The analysis confirms that Swedish NN compounds manifest a multitude of semantic relations, and that French uses several different constructions in corresponding cases. NA and N de N phrases, the two most frequent French counterparts, exhibit almost all the semantic relations expressed by the Swedish compounds. Inversely, two of the most frequent semantic relations, PURPOSE and CLASSIFY, are rendered by nearly all the French constructions. Furthermore, French NN constructions are rarely attested and considerably more semantically rigid compared to Swedish NN compounds.