Simple Predicates Research Articles

Интонация и ударение на прости двусъставни изречения

The research deals with the intonational characteristics and the stress in simple sentences taken from Bulgarian classic literature. By using software for acoustic analysis, we observe the intonational contours of simple sentences, aiming at characterizing the specific intonational features of the verb and its outer complement. We also observe the intonational features of the predicate in cases of different word order (SVO, SOV, VSO, etc.) The main goal is to summarize the data on stress and intonation of simple sentences from our corpus and to represent it as models of the prosody of simple predicates in Bulgarian.

Փոխակերպումը որպես լեզվական արտացոլման վերացարկված մեխանիզմ

Transformation is the expression of the same linguistic content using alternative structures, it is seen as an abstracted mechanism of linguistic expression. The transformation is accomplished through sentence-phrase- composition stages which are characterized by different degrees of abstraction.The generating patterns of transformation of a sentence into a word-combination are subordinate word-combinations which transform from communicative into nominal units (free and fixed combinations). Fixed combinations are formed by the corresponding displacement of the syntactic position of a free pattern or by means of the elipsis of the components. Patterns of compound and derivative words are in their turn characterized by various degrees of abstraction. A suffix has a higher degree of abstraction than a component of a compound word. The patterns of compound words are characte-rized by the existence of final components and they come in a variety of constructions: verb-stems, nominal components, and verb-components. Derivational patterns are characterized from two perspectives: prefixal and suffixal. In the process of transformation – the verbal component bears the semantic load of transformations. It is transformed from a simple predicate of the sentence into a derived word-combination, whereas in the compound words – into a verb-steem acting as the dominant component.

Exponence and the functional load of grammatical tone in Gyeli

AbstractGrammatical tone (GT) can be the sole exponent or a co-exponent of grammatical meaning (Hyman 2012; Rolle 2018), but there has been little discussion of how they distribute within a single language. In this article, I explore the relationship between tonal and segmental materials in Gyeli (Bantu A801, Cameroon), adopting a property-driven approach to phonological typology (Plank 2001; Hyman 2009). Gyeli has eight GTs in simple predicates, which serve as sole exponents of tense, aspect, mood and polarity distinctions and object-marking. When GT is a co-exponent accompanied by segmental material, for example, in auxiliary constructions, the information that the tonal component contributes to the meaning is insufficient to distinguish between grammatical categories: its functional load is weak. The decrease in functional load is correlated with an increase in length of a segmental co-exponent. This can be explained by the tonal cophonologies of segmental morphemes and their different GT dominance types.

VALENCY OF THE PREDICATE IN COMPARATIVE LINGUISTICS

Valence theory is increasingly being used to improve the effectiveness of teaching a foreign language. The goal is to identify the theory of valence in comparative linguistics. The valency of the predicate is the property of the part of the sentence to demand of the usage of different parts of the sentences, based on the semantics of that full-valued word (primarily of a verb, further of an adjective and a predicative, and lesser of a noun), which is used as a simple predicate or the main element of a compound predicate. The main results are that when comparing syntactic phenomena, their close relationship with the morphological and lexical phenomena of the compared languages is taken into account. Researchers often choose morphological categories and units as the most clearly defined and studied as the starting point of the analysis, which are closely related to syntactic phenomena. In the field of syntax, namely theory of valence of predicate that can easily be associated with the principles of language matching. At the same time, the standard meaning of proposals is the central part.

Policy-driven Data Sharing over Attribute-Based Encryption supporting Dual Membership

Attribute-Based Encryption (ABE) plays an important role in current secure data sharing through fine-grained customizable policies. However, the existing ABE schemes only support simple predicates, = and ≠, but cannot express a more general membership predicates, ∈ and ∉, in policies. The low expressivity of ABE will enlarge the ciphertext storage and reduce the communication efficiency. To overcome this problem, we propose an ABE supporting Dual Membership (DM-ABE). The core problem for implementing this scheme is how to use cryptographic methods to decide the membership between the verified element and the given set. In order to solve this problem, we design a cryptographic algorithm, called Secure Decision of Membership (SDM), based on aggregation functions. In this algorithm, any set can be aggregated into one cryptographic element, and the verified element and the given set can be converted into another cryptographic element in decision process. The membership between them can be decided by the above two cryptographic elements. Furthermore, we construct the DM-ABE by using SDM. Because of the good expressivity of our DM-ABE, we further propose a novel cryptographic data sharing framework by integrating DM-ABE and attribute-based access control to provide fine-grained access control and security protection for private data. In the security proof of DM-ABE, we prove that the DM-ABE satisfies the semantic security against chosen-plaintext attacks under the DBDHE assumption in the standard model through a unified way, considering both two encryption methods for ∈ and ∉ at the same time. Finally, we analyze our scheme in terms of time and space complexity, and compare it with some existing schemes. The results show that our DM-ABE has a better expressive ability on the boolean logic of general membership predicates, ∈ and ∉.

Interrelation of types of separate forms of logic and linguistic models and types of sentences of natural language

The article proposes an apparatus of logic and linguistic modeling for extracting knowledge from electronic text documents. Different types of forms of logic and linguistic models have been singled out for the formalized representation of complex sentences of natural language. The author formulates the rules and carries out the classification of separate forms of logic and linguistic models depending on syntactic constructions of sentences natural language. Such separate forms of logic and linguistic models are templates with certain logical operations, which are used depending on the punctuation marks and connecting words applied in sentences. The specific order of simple predicates depends on the logical connections between simple sentences in the structure of the complex one. This allows to develop an algorithm for further analysis of textual information and its recovery from formal models of knowledge representation. Figs.: 1. Refs.: 12 titles.

Clefting and nominal predication: Two focus-marking constructions in Movima

Abstract Movima (isolate, Bolivia) has two focus constructions that superficially look very similar. One is a simple clause with a noun in predicate position and a verb placed inside the argument phrase. Its pragmatically marked status stems from the inversion of the prototypical association of lexical and pragmatic categories. In the other construction, the predicative noun is additionally preceded by a free pronoun. This construction is a cleft, the pronoun and noun together constituting an equational matrix clause. The two constructions also differ in function: the simple clause with a nominal predicate is a simple predication, while the cleft is a specificational sentence.

Multi-modal actuation with the activation bit vector machine

Research towards a new approach to the abstract symbol grounding problem showed that through model counting there is a correspondence between logical/linguistic and coordinate representation in the visuospatial domain. The logical/verbal description of a spatial layout directly gives rise to a coordinate representation that can be drawn, with the drawing reflecting what is described. The main characteristic of this logical property is that it does not need any semantic information or ontology apart from a separation into symbols/words referring to relations and symbols/words referring to objects. Moreover, the complete mechanism can be implemented efficiently on a brain inspired cognitive architecture, the Activation Bit Vector Machine (ABVM), an architecture that belongs to the Vector Symbolic Architectures. However, the natural language fragment captured previously was restricted to simple predication sentences, with the corresponding logical fragment being atomic Context Logic (CLA), and the only actuation modality leveraged was visualization. This article extends the approach on all three aspects: adding a third category of action verbs we move to a fragment of first-order Context Logic (CL1), with modalities requiring a temporal dimension, such as film and music, becoming available. The article presents an ABVM generating sequences of images from texts.

Complex predicates and space in Dâw (Naduhup language, AM)

AbstractComplex predication is understood to be a highly productive process in Northwestern Amazonian languages in which complex predicates may be realized as compounds, verb-auxiliary constructions or serial verb constructions depending on language-internal criteria. These constructions play an important role in the organization of discourse and information packaging and can also carry out grammatical functions such as increasing or decreasing valency. In Dâw, a language from the Naduhup family, complex predicates are used to express spatial notions such as directionality and manner in complex motion events or to provide detailed of how complex predicates in Dâw function as semantic and syntactic resources used to express space in discourse in comparison to their expression in simple predicates. I provide a typology of the most frequent patterns and their respective ordering principles found in our corpus in order to understand how fine-grained spatial notions are expressed in Dâw.

Towards formalizing the GDPR’s notion of singling out

There is a significant conceptual gap between legal and mathematical thinking around data privacy. The effect is uncertainty as to which technical offerings meet legal standards. This uncertainty is exacerbated by a litany of successful privacy attacks demonstrating that traditional statistical disclosure limitation techniques often fall short of the privacy envisioned by regulators. We define "predicate singling out," a type of privacy attack intended to capture the concept of singling out appearing in the General Data Protection Regulation (GDPR). An adversary predicate singles out a dataset x using the output of a data-release mechanism [Formula: see text] if it finds a predicate p matching exactly one row in x with probability much better than a statistical baseline. A data-release mechanism that precludes such attacks is "secure against predicate singling out" (PSO secure). We argue that PSO security is a mathematical concept with legal consequences. Any data-release mechanism that purports to "render anonymous" personal data under the GDPR must prevent singling out and, hence, must be PSO secure. We analyze the properties of PSO security, showing that it fails to compose. Namely, a combination of more than logarithmically many exact counts, each individually PSO secure, facilitates predicate singling out. Finally, we ask whether differential privacy and k-anonymity are PSO secure. Leveraging a connection to statistical generalization, we show that differential privacy implies PSO security. However, and in contrast with current legal guidance, k-anonymity does not: There exists a simple predicate singling out attack under mild assumptions on the k-anonymizer and the data distribution.

Using likely invariants for test data generation

Various approaches have been developed to tackle the problem of automatic test data generation. Among them search-based methods use metaheuristic algorithms to guide search in the input space of the program under test. This paper presents a new approach for improving search-based test data generation methods. This approach is based on learning the relationships between program input values and program parts covered by those values. The learned relationships are used to accelerate achieving test coverage goals. We introduce the concepts of branch likely invariant and path likely invariant as the basis for the learning method. In addition, we utilize simple predicates (based on some predefined templates) over program input variables to generate better initial candidate solutions, and use the mutation of the mentioned predicates to cover unexplored program parts. The current version of the proposed approach only considers numeric and string input parameters. To evaluate the performance of the proposed approach, a series of experiments have been carried out on a number of different benchmark programs. Through experiments and analysis, we show that the proposed approach enhances the effectiveness of common search-based test data generation methods, in terms of the coverage percentage.

Syntactic Relations Reflected by Word Order in "The Catcher in the Rye" by J. D. Salinger and "Fates and Furies" by L. Groff

The research features syntactic structure in the twentieth century "The Catcher in the Rye" by J. D. Salinger and the twenty first century "Fates and Furies" by L. Groff. The research objective was to study the nature of syntactic relations expressed by word order in speech of narrators and characters. The paper outlines the rules of word order in the English sentence and reviews related studies in the field of syntax. The author analyzed the syntactic structure of sentences in the speech of narrators and characters in the two novels. The analysis was based on the descriptive method and techniques of observation, interpretation, comparison, and generalization. There were numerous examples of omission of auxiliary verbs in interrogative sentences in characters' speech, as well as interrogative sentences with affirmative structure. In "The Catcher in the Rye", affirmative sentences obecame interrogative with the help of interjections eh and ah. Both novels contained sentences where adverbial modifiers, objects, or attributes preceded the main parts – in the narrators' speech. A lot of one-member and contextually incomplete sentences were used to describe events and personages in both novels. In "The Catcher in the Rye", the narrator's speech revealed few cases of violations of word order rules, mostly in sentences with direct word order. The characters' speech appeared to contain much more cases of word order violations, since the novel features colloquial speech of twentieth century American teenagers. The speech of adult personages was characterized by correct word order. In "Fates and Furies", the narrator's speech demonstrated a significant number of elliptical sentences where auxiliary verb to be was omitted in simple verbal predicate with the verb in Present Continuous, as well as in compound nominal predicate and in passive voice. A comparative study of syntactic structure contributed to a deeper understanding of the nature of syntactic relations reflected by word order in the English sentence, grammatical structure of the English language, and popular types of sentences. In addition, the study showed the way native speakers express their ideas and thoughts by linguistic means and violate linguistic norms. The results can be used in various grammar courses and compiling textbooks.

Verbal Clause Construction of Ciacia Language: Syntactic Typology Study

Typology study of Ciacia language (CL) in various linguistic aspects has not been conducted yet. It is the first study that focus on syntactic typology. Ciacia language is one of local languages in Buton Regency, Southeast Sulawesi Province. The study focuses on five main problems, they are (1) How is the base construction of verbal clause in CL? (2) How are the predicate and structure argument constructions of verbal clause in CL, (3) How are the simple predicate and complex predicate constructions of verbal clause in CL? (4) How are valency and valency change mechanism of verbal clause construction in CL? (5) How are complex sentence construction and grammatical alliance system?. The oral data of this study is obtained through recording and elicitation techniques. Written data is obtained through the previous studies. The study also used synthetic data which is verrified by the informants. The data was analyzed by apportion (distributional) method.
 The investigation of clause base construction shows that verbal clause construction of Ciacia language is always filled by subject and aspect markers (PS/A) that is affixed to PRED verb. Base structure of verbal clause in CL consists of verbal predicated clause and non-verbal predicated clause. Non-verbal predicated clause can be constructed through base nominal and adjective categories. Verbal clause predicate can be filled by intransitive base verb, mono transitive base verb, ditransitive base verb, and ambi-transitive base verb.
 Predication and argument structure of verbal clause construction in CL can be classified in to verbal clause: (i) intransitive with one main argument in terms of SUBJ and as A or OBJ systematically; (ii) semi-transitive with one main argument as A/ACT and with the presence of OBJ argument optionally; (iii) mono-transitive with two main arguments, namely SUBJ as A/ACT with one OBJ argument as UND, (iv) ditransitive with three main arguments, namely SUBJ as A/ACT before PRED and two arguments after PRED, in terms of OTL (indirect object) and OL (direct object); and (v) ambi-transitive with one main argument, namely SUBJ, either as Sa or as So.
 Valency and transitivity of verbal clause construction in CL consists of (i) valency and intransitive verb transitivity with one argument or verb with one valency; (ii) semi-transitive verb with one argument before verb and the presence of argument after Pred verb optionally; (iii) transitive with the obligatory of O presence after Pred verb, so it has two main arguments or verb that has two valency arguments, namely S and O; (iv) ditransitive with three main arguments or verb that has three valency arguments; (v) ambi-transitive with only one argument or verb that has one valency.
 Verbal clause construction in CL can be filled by simple Pred verb and complex Pred verb. Simple predicate is created by base verb/intransitive verb and non-verb category, semi-transitive verb, and transitive verb with PS/A. Complex predicate is created through verb (i) intransitive; (ii) semi-transitive verb; and (iii) transitive integral verb. The valency change mechanism of verbal clause construction in CL can be done through formal causativation and semantic causativation, applicative, and resultative.

Actualism, Serious Actualism, and Quantified Modal Logic

This article studies seriously actualistic quantified modal logics. A key component of the language is an abstraction operator by means of which predicates can be created out of complex formulas. This facilitates proof of a uniform substitution theorem: if a sentence is logically true, then any sentence that results from substituting a (perhaps complex) predicate abstract for each occurrence of a simple predicate abstract is also logically true. This solves a problem identified by Kripke early in the modern semantic study of quantified modal logic. A tableau proof system is presented and proved sound and complete with respect to logical truth. The main focus is on seriously actualistic T (SAT), an extension of T, but the results established hold also for systems based on other propositional modal logics (e.g., K, B, S4, and S5). Following Menzel it is shown that the formal language studied also supports an actualistic account of truth simpliciter.

Structural and semantic ambiguity of why-questions: An overlooked case of weak islands in English

We argue that English why-questions are systematically ambiguous between a purpose and a reason interpretation, similarly to Mandarin, Russian, and Polish (contra Stepanov & Tsai 2008). We argue that the distinct semantic interpretations correspond to two distinct base-generated positions of why. While reason why is base-generated within CP (Rizzi 2001, Ko 2005), purpose why is adjoined to vP (Stepanov & Tsai 2008). Furthermore, we show that English purpose why, similarly to previously reported data from Mandarin, is only compatible with dynamic predicates with agentive subjects. We argue that this selectional restriction follows from two properties: (i) why semantically requires a proposition as its argument, and (ii) only dynamic predicates with agentive subjects have a syntactic structure that accommodates two adjunction sites of the relevant semantic type, i.e., they contain two distinct propositional levels (Bale 2007) and therefore two attachment sites for why. In contrast, propositionally simple predicates only have one propositional level and hence only one possible attachment site, which corresponds to the reason interpretation of why. Evidence for this proposal comes from the observation that only the lower why - associated with the purpose reading - is sensitive to negative islands, which suggests that its attachment site is below negation (vP), whereas the higher why is insensitive to island effects of this sort, which suggests that its base generated position is above negation (CP).

Predicate Detection in Asynchronous Distributed Systems: A Probabilistic Approach

In an asynchronous distributed system, a number of processes communicate with each other via message passing that has a finite but arbitrary long delay. There is no global clock in that system. Predicates, denoting the states of processes and their relations, are often used to specify the information of interest in such a system. Due to the lack of a global clock, the temporal relations between the states at different processes cannot be uniquely determined, but have multiple possible circumstances. Existing works of predicate detection are based on the definitely modality or the possibly modality, denoting that a predicate holds in all of the possible circumstances or in one of them, respectively. No information is provided about the probability that a predicate will hold, which hinders the taking of countermeasures for different situations. Moreover, the detection is based on single occurrence of a predicate, so the results are heavily affected by environmental noise and detection errors. In this paper, we propose a new approach to predicate detection to address these two issues. We generalize the definitely and possibly modalities to an occurrence probability to provide more detailed information, and further investigate how to detect multiple occurrences of a predicate. We propose a unified algorithm framework for detecting various types of predicates and demonstrate the use of it for three typical types of predicates, including simple predicates, simple sequences, and interval-constrained sequences. Theoretical proofs and simulation results show that our approach is effective and outperforms existing approaches.

Synonymy Relationships between the Subjunctive and the New Infinitive in the Syntactic Aspect

The object of this study is the relationship between the subjunctive mood and infinitive in the Albanian language. Subjunctive is one of the inherited moods in Albanian. Apart from the indicative, subjunctive is also widely used, because it expresses a variety of modal meanings. The frequency of subjunctive mood usage, mainly in the south dialect, is related to its use as a synonym to the infinitive. The subjunctive mood coincides with the non-finite forms, especially the infinitive. This coincidence is evident on the syntactic aspect and its functional point of view, as well. The synonymy of infinitive to the subjunctive is observed in the present standard Albanian language. In most of the infinitive uses, we can easily replace them with the subjunctive, without causing any changes in the modality or relationship with other syntactic units. This substitution is not always possible. This occurs in the category of subordinate or main clauses and simple sentences in the function of the simple predicate. Nevertheless, nowadays, we notice synonymy relationships between the subjunctive and infinitive, especially with the grammatical constructions that denote meanings of purpose. In the relative clauses, this synonymy is much more limited. Substitution of the infinitive with the subjunctive in such constructions can bring slight changes of meaning. Anyway, we should emphasize that despite the value of the infinitive, the subjunctive mood is widely used in the national literary language.

Structured lexical concepts, property modifiers, and Transparent Intensional Logic

In a 2010 paper Daley argues, contra Fodor, that several syntactically simple predicates express structured concepts. Daley develops his theory of structured concepts within Tichý’s Transparent Intensional Logic (TIL). I rectify various misconceptions of Daley’s concerning TIL. I then develop within TIL an improved theory of how structured concepts are structured and how syntactically simple predicates are related to structured concepts.

Locatum Structures and the Acquisition of Telicity

This article presents a study of a between-subjects design experiment on the comprehension of telicity in simple telic predicates (e.g., John filled the bucket) and locatum predicates (e.g., the water filled the bucket) in L1 Spanish. Weist, Wysocka, and Lyytinen (1991) for English and Finnish, and Van Hout (1997, 1998b) for English and Dutch have shown that children up to age 6;06 allow simple telic predicates to have both telic and atelic interpretations. The main objective of this article is to show that children aged 3;09 allow locatum structures to be interpreted as telic, like adults, but allow simple telic predicates to have telic and atelic interpretations. The central claim is that in simple telic predicates, telicity is checked by covert movement, while in locatum predicates, telicity is checked by overt movement. Children misinterpret simple telic predicates because covert movement is an operation that takes place after the branching off to the PF component, but perform like adults when overt movement is involved.

Choice of optimal complexity of the class of logical decision functions in pattern recognition problems

At present, problems related to data mining are aris-ing in various poorly formalizable areas of research(genetics, archaeology, medicine, etc.). Such problemsare characterized by insufficient knowledge about theobjects under study, which hampers the development ofmathematical models for them; by a large number ofmultitype (quantitative and qualitative) factors and arelatively small amount of data; and by the requirementthat analysis results be represented in a form clear toexperts in applied areas.A promising approach to solving such problems isbased on the class of logical decision functions. Theyare frequently represented in the form of a decisiontree. A detailed description of this class and referencescan be found in [1].The construction of decision functions with a mini-mal risk of erroneous predictions is an important task inmethods based on logical decision functions and inother data analysis techniques. It is well known that thecomplexity of the class of decision functions (thecapacity characteristic of the class [2]) is a importantfactor affecting the quality of decisions. To achieve thebest quality, we need a certain tradeoff between thecomplexity of the class and the accuracy of decisionsobtained on the training sample. Thus, the problemarises of choosing an optimal complexity of the class.In numerous applications, empirical data (trainingsample) are supplemented with expert knowledge,which is not tightly related to a distribution model(expert knowledge can be specified as upper bounds forthe risk; they can express constraints on the class of dis-tributions or the class of decision functions, specifypreference rules used in decision making, etc.). Whenan optimal complexity of the class is chosen, availableempirical data and expert knowledge have to be jointlytaken into account.This problem can be solved within the framework ofthe Bayesian learning theory. The idea behind thisapproach is to use a priori knowledge about the prob-lem in question so that each possible distribution (strat-egy, the state of nature) is assigned a certain weight.This weight reflects the expert’s intuitive confidence inwhether the unknown true distribution coincides withthat under consideration.In this paper, we propose a Bayesian recognitionmodel based on a finite set of events. The model is usedto develop and analyze methods for constructing logi-cal decision functions. While choosing an optimal com-plexity of the class, the model takes into account empir-ical data and expert knowledge.In pattern recognition, the task is to predict the pat-tern’s index for an arbitrary object of the populationdescribed by a set of variables. The prediction is madeby analyzing a training sample consisting of the valuesof these variables, together with the index of the corre-sponding pattern for each object. The variables can beof different types; i.e., some of them can be quantita-tive, while the others can be qualitative. As a rule, theproblem is solved in a class of decision functions inwhich an optimal function is sought according to agiven criterion. The class of logical decision functionsis defined on a set of partitions of the feature space intoa finite number of subdomains described by conjunc-tions of simple predicates. The number of subdomainsdetermines the degree of complexity of a logical func-tion.A Bayesian pattern recognition model on a finite setof events is defined by formulating certain statementsthat avoid the local metric properties of the featurespace (the transition from points of the space to events,where an event is understood as that of the original vari-ables taking values from a certain subdomain of thepartition). Moreover, the pattern recognition problem isconsidered on the values of a discrete unordered vari-able, the concept of a learning method (a mapping from