Natural Semantics Research Articles

Typology Lexical Verb 'To Use' in Japan: Natural Semantics Metalanguage Study


 
 
 This study entitled Typology of Lexical Verb 'Use' In Japanese: Study of Natural Semantic Metalanguage. The research objective is to understand verb ‘use’ of the Japanese language. The specific objective is to describe forms, structures, and to avoid the meaning of swirling. Analysis using Semantic Theory of Natural Metalanguage (MSA) which is pioneered by Wierzbicka (1996). To analyze the data the author uses a descriptive method, that describe the elements used by default lexical verb ‘meaning'. Then the mapping exponent through explication by using a paraphrase. Data were analyzed semantic structure. Ways of presenting the data analysis using informal methods, namely the use of words. 14 types of the Japanese verb have the meaning of 'use, ' i.e., kaburu, maku, haku, hameru, shimeru, sauces, kiru, Kakeru, tsukeru, tsukau, mochiiru, shiyo suru, suru riyou, chakuyo suru, which is often found in the books of Japanese. This study has given a clear enough picture of the technical explication of the state of one form or lexicon to one meaning and one meaning for one form or lexicon.
 
 

VERBA “MELUKAI” DALAM BAHASA ROTE DIALEK DENGKA: KAJIAN META SEMANTIK ALAMI (MSA)

This article will analyze and examine the verb “to hurt” found in Dengka Dialect of Rote Language. Based on the data collected from the informants, there are nineteen lexicons discovered and each of them will be further described in the discussion part of this article. The nineteen lexicons are: uta, tati, mbau, donggi, dui, undu, teta, ela, kalu, ali, isi, iɁi, tede, soso, nato, edo, ule, tutu and dodo. The approach applied to analyze those nineteen lexicons is natural semantics meta-language (NSM). By using this approach, we would optimise the analysis in order to obtain a better result, since there is only one meaning for each lexicon. The results of this analysis could become a reference for the readers and the researchers in writing articles using their language that related to semantics by using natural semantics meta-language theory.

MAKNA “MEMANCING” BAHASA BALI DIALEK DESA LEMBONGAN: KAJIAN METABAHASA SEMANTIK ALAMI

[Title: Meaning of “Memancing”Balinese Language of Lembongan Village Dialect : The Study of Natural Semantics Metalanguage] The word ‘memancing” (fishing) can be found in most languages in the world and this word is unique in the Balinese Language of Lembongan Village Dialect as it various hyponymies. This research is intended to recognize and explain the meaning of “memancing” in Balinese of Lembongan Village Dialect and to preserve the lexicons that are almost extinct due to the rapid development of tourism. To analyze the problems of this research, the NSM theory is applied to the concept of semantic primitive, polysemy, allolection, and universal syntax. The phases of NSM theory in analyzing the meaning of “memancing” in BBDL are configurations of components to find out distinctive features, and explication to study the information on the meaning of “memancing” which includes entity imposed by the treatment, the equipment use, the uniqueness of movement and the expected proceeds. From the analysis, it is found that there are seven lexicons having the meaning of “memancing” with distinctive features, namely: memelas, ngerumik, ngulur, melok, muduk, maidang dan nyogonang.

Operators of preference composition for CP-nets

Abstract Now the handling of user preference is becoming an increasingly important issue in database fields where they capture soft criteria for queries. A broader category of qualitative preferences with dependent relations among multiple attributes is widely existing, which is CP-nets. In this article, we focus on designing the operators of preference composition for CP-nets. Firstly, we extend Pareto composition to our model by including equivalence relation ≈, incomparability relation ∥ and conflicting relation ⊥, which can preserve a strict partial order and conditional associativity. On this basis, two questions are solved: (a) the generation of satisfiability sequences for CP-nets, (b) the top - k queries of relational database with CP-nets preference. For (a), a CP-net is induced into multiple tables, consequently the strong dominance tests between outcomes can be solved by using preference composition instead of using induced preference graph of CP-nets. For (b), we adopt the concept of Query Lattice to provide a natural semantics for the block sequence answering a preference query, where two algorithms (called QOCP and IQOCP ) are introduced. These questions are solved efficiently and effectively at the perspective of combination of graph model and relational database.

Makna “Mengambil” Bahasa Bali: Pendekatan Metabahasa Semantik Alami (MSA)

This research describes the meaning of the verb 'mengambil' in Balinese language based on the theory of Natural Semantics Metalanguage (NSM) by using one of NSM theory is noncomposition polysemy. This research is to obtain a comprehensive picture of the realization of the lexical verb “mengambil” in Balinese languange, The data of this research was obtained from Balinese people serounding who communicate in Balinese languange and the author's own intuition because the author is a native speaker of the Balinese language used. The method used in this research is descriptive-qualitative method, the data will be analyzed by using the theory of NSM by following the steps as follows: the classification of the data, analyze the semantic structure of the verb 'mengambil', and describes the components obtained resulting configuration meaning the user to obtain the feature distinctive. Furthermore, the technique of paraphrasing would look if there lexicon 'mengambil' that has a paraphrase of the same or different depending on the meaning of default is used. Based on the analysis conducted found that the verb “mengambil”' in Balinese language can be expressed in some lexicons, they are: “ nyemak/ngambil, nyuang, nuduk , nimba, ngarebut, nyopet, ngarampok, nyambret, ngamaling dan ngutil”

MAKNA “MENGAMBIL” BAHASA BALI: PENDEKATAN METABAHASA SEMANTIK ALAMI (MSA)

This research describes the meaning of the verb 'mengambil' in Balinese language based on the theory of Natural Semantics Metalanguage (NSM) by using one of NSM theory is noncomposition polysemy. This research is to obtain a comprehensive picture of the realization of the lexical verb “mengambil” in Balinese languange, The data of this research was obtained from Balinese people serounding who communicate in Balinese languange and the author's own intuition because the author is a native speaker of the Balinese language used. The method used in this research is descriptive-qualitative method, the data will be analyzed by using the theory of NSM by following the steps as follows: the classification of the data, analyze the semantic structure of the verb 'mengambil', and describes the components obtained resulting configuration meaning the user to obtain the feature distinctive. Furthermore, the technique of paraphrasing would look if there lexicon 'mengambil' that has a paraphrase of the same or different depending on the meaning of default is used. Based on the analysis conducted found that the verb “mengambil”' in Balinese language can be expressed in some lexicons, they are: “ nyemak/ngambil, nyuang, nuduk , nimba, ngarebut, nyopet, ngarampok, nyambret, ngamaling dan ngutil”

MEANINGS ON VARIOUS COOKING MANNERS IN VERB FORMS

This paper aims at investigating the meaning of verb form ‘cook’ having one form withdifferent manners of cooking something. Therefore, the analysis discusses about the variouscooking manners in verb forms because cooking is an action or do something. The data wastaken from the article about cooking procedure, by note taking technique. The data wasfurther analyzed by natural semantics metalanguage. The result showed that verbs in cookingaction have some similar meaning with different manners such as the manner cooking ofblanch means cooking food into boiling water in a few minutes, while the manner cookingof steam means cooking food on the boiled water. Here, metalanguage manages to describeand analyze the verb meaning in cooking manners.

A New Semantics for Vagueness

Intuitively, vagueness involves some sort of indeterminacy: if Plato is a borderline case of baldness, then there is no fact of the matter about whether or not he’s bald—he’s neither bald nor not bald. The leading formal treatments of such indeterminacy—three valued logic, supervaluationism, etc.—either fail to validate the classical theorems, or require that various classically valid inference rules be restricted. Here we show how a fully classical, yet indeterminist account of vagueness can be given within natural semantics, an alternative semantics for classical proof theory. The key features of the account are: there is a single notion of truth—definite truth—and a single notion of validity; sentences can be true, false, or undetermined; all classical theorems and all classical inference rule are valid; the sorites argument is unsound; ‘definitely’ is treated as a meta-language predicate; higher-order vagueness is handled via semantic ascent.

Partial and Complete Processes in Multiparty Sessions

Multiparty sessions describe the interactions among multiple agents in a distributed environment and require essentially two steps: the specification of the communication protocols and the implementation of such protocols as processes. Multiparty session types address this methodology: global and session types provide the communication protocols, whereas the processes describe the behaviour of the peers involved in the sessions. Because of the close relationships between types and processes, some information, such as the names of senders and receivers, are replicated both in types and in processes. In multiparty conversations it is quite natural that participants with essentially the same role are implemented by processes that follow the same pattern, differing only in the senders and receivers of communication actions. In order to allow for a lighter and less rigid development of processes, we propose a translation tool which allows one to write processes in a simplified syntax, called partial syntax, where the names of senders/receivers for input/output operations are omitted. By adding the missing information, partial processes can be automatically translated in complete processes, for which an operational semantics is defined. The partial syntax, in particular, allows one to use the same process template to implement similar participants. In this paper we present a translation and type checking algorithm from partial to complete processes, which, if successful, also assures that the target processes are well typed. The algorithm is synthesised from a rule-based description of the translation in natural semantics and it is proved sound and complete with respect to the translation rules.

Semantics, knowledge and grids

Summary Semantics, knowledge and grids represent three streams of studying humans and cyberspace that humans create and interact. Relevant research concerns all areas of computing, especially web semantics, artificial intelligence, and advanced computing infrastructures. This special issue selected eight papers reporting relevant research and applications from the 9th International Conference on Semantics, Knowledge and Grids. Copyright © 2015 John Wiley & Sons, Ltd.

A Science of Qualities

The apparent dichotomy between qualitative versus quantitative dimensions in science intersects with the domain of several disciplines, as well as different research fields within one and the same discipline. The perception of qualitative as “poor quantitative,” however, is methodologically unsustainable, because there are perfectly rigorous ways to conduct qualitative research. A somehow different question is whether a science of qualities per se is possible: that is, whether a science of appearances can be devised, what its observables are, and its methodological implications. The article deals with this last issue, and especially from the point of view of experimental phenomenology. The weakness of the current approach to perception is discussed, and an alternative view that goes beyond veridicalism is presented. The analysis tackles crucial issues such as color and spatial appearances, the qualitative dimension of perceived depth, and the role of visual meaningful gestalten as information tools for the survival of living beings in the environment. If developed, a science of the qualitative dimensions of appearances may contribute to revising the ecological theory of perception by making its natural semantics more explicit.

State and path coalition effectivity models of concurrent multi-player games

We consider models of multi-player games where abilities of players and coalitions are defined in terms of sets of outcomes which they can effectively enforce. We extend the well studied state effectivity models of one-step games in two different ways. On the one hand, we develop multiple state effectivity functions associated with different long-term temporal operators. On the other hand, we define and study coalitional path effectivity models where the outcomes of strategic plays are infinite paths. For both extensions we obtain representation results with respect to concrete models arising from concurrent game structures. We also apply state and path coalitional effectivity models to provide alternative, arguably more natural and elegant semantics to the alternating-time temporal logic ATL*, and discuss their technical and conceptual advantages.

A compositional automata-based semantics and preserving transformation rules for testing property patterns

Abstract Dwyer et al. provide a language to specify dynamic properties based on a limited number of predefined patterns and scopes. The semantics of these properties is defined by translating each combination of a pattern and a scope into usual temporal logics (linear temporal logic, CTL, etc.). This translational semantics suffers from two main issues. It is not easily extensible to other patterns or scopes, and it is not always faithful to the natural semantics. In this article, we propose a compositional automata-based approach defining the semantics of each pattern and each scope by an automaton, after which the semantics is composed. Hence, the semantics is compositional and the language is easily extensible. We compare the two semantics by model checking. In some cases, our semantics reveals a lack of homogeneity within Dwyer et al.’s semantics. Finally, we apply this approach in the context of property-based testing, in order to evaluate the quality of a test suite, by measuring the coverage of the property automaton. To allow the tester to adapt the coverage criteria to its goals, we propose transformation rules over the patterns automata that implement relevant unfolding strategies for loops, or predicates labeling the automata transitions. We illustrate these principles by means of an industrial case study.

Algebraic semantics for a modal logic close to S1

The modal systems S1--S3 were introduced by C. I. Lewis as logics for strict implication. While there are Kripke semantics for S2 and S3, there is no known natural semantics for S1. We extend S1 by a Substitution Principle SP which generalizes a reference rule of S1. In system S1+SP, the relation of strict equivalence $\varphi\equiv\psi$ satisfies the identity axioms of R. Suszko's non-Fregean logic adapted to the language of modal logic (we call these axioms the axioms of propositional identity). This enables us to develop a framework of algebraic semantics which captures S1+SP as well as the Lewis systems S3--S5. So from the viewpoint of algebraic semantics, S1+SP turns out to be an interesting modal logic. We show that S1+SP is strictly contained between S1 and S3 and differs from S2. It is the weakest modal logic containing S1 such that strict equivalence is axiomatized by propositional identity.

A propositional linear time logic with time flow isomorphic to [formula omitted

Primarily guided with the idea to express zero-time transitions by means of temporal propositional language, we have developed a temporal logic where the time flow is isomorphic to ordinal ω2 (concatenation of ω copies of ω). If we think of ω2 as lexicographically ordered ω×ω, then any particular zero-time transition can be represented by states whose indices are all elements of some {n}×ω. In order to express non-infinitesimal transitions, we have introduced a new unary temporal operator [ω] (ω-jump), whose effect on the time flow is the same as the effect of α↦α+ω in ω2. In terms of lexicographically ordered ω×ω, [ω]ϕ is satisfied in 〈i,j〉-th time instant iff ϕ is satisfied in 〈i+1,0〉-th time instant. Moreover, in order to formally capture the natural semantics of the until operator U, we have introduced a local variant u of the until operator. More precisely, ϕuψ is satisfied in 〈i,j〉-th time instant iff ψ is satisfied in 〈i,j+k〉-th time instant for some nonnegative integer k, and ϕ is satisfied in 〈i,j+l〉-th time instant for all 0≤l<k. As in many of our previous publications, the leitmotif is the usage of infinitary inference rules in order to achieve the strong completeness.

Distributed Timed Automata with Independently Evolving Clocks

We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of the other components. A clock can be read by any component in the system, but it can only be reset by the automaton it belongs to. There are two natural semantics for such systems. The universal semantics captures behaviors that hold under any choice of clock rates for the individual components. This is a natural choice when checking that a system always satisfies a positive specification. To check if a system avoids a negative specification, it is better to use the existential semantics---the set of behaviors that the system can possibly exhibit under some choice of clock rates. We show that the existential semantics always describes a regular set of behaviors. However, in the case of universal semantics, checking emptiness or universality turns out to be undecidable. As an alternative to the universal semantics, we propose a reactive semantics that allows us to check positive specifications and yet describes a regular set of behaviors.

Pretty-big-step-semantics-based Certified Abstract Interpretation (Preliminary version)

We present a technique for deriving semantic program analyses from a natural semantics specification of the programming language. The technique is based on a particular kind of semantics called pretty-big-step semantics. We present a pretty-big-step semantics of a language with simple objects called O'While and specify a series of instrumentations of the semantics that explicitates the flows of values in a program. This leads to a semantics-based dependency analysis, at the core, e.g., of tainting analysis in software security. The formalization has been realized with the Coq proof assistant.

Functional description extraction of code based on formal semantics of Clight

Code function description extraction is the basic premise of functional integration.To address the problem of common low accuracy rate of extraction of code function,the mechanism of extracting code function description based on formal semantic of Clight was proposed,and it was realized by algorithm of Clight code function description.This mechanism was strictly based on Clight natural semantics inference rules,ignoring the details of code execution in the middle,only concerned with the memory states before and after implementation.And as a functional description of the code feature description,it improved the accuracy of functional extraction and the success rate of the key area in software development.

The language of plain SO-tgds: Composition, inversion and structural properties

The problems of composing and inverting schema mappings specified by source-to-target tuple-generating dependencies (st-tgds) have attracted a lot of attention, as they are of fundamental importance for the development of Bernsteinʼs metadata management framework. In the case of the composition operator, a natural semantics has been proposed and the language of second-order tuple generating dependencies (SO-tgds) has been identified as the right language to express it. In the case of the inverse operator, several semantics have been proposed, most notably the maximum recovery, the only inverse notion that guarantees that every mapping specified by st-tgds is invertible. Unfortunately, less attention has been paid to combining both operators, which is the motivation of this paper. More precisely, we start our investigation by showing that SO-tgds are not good for inversion, as there exist mappings specified by SO-tgds that are not invertible under any of the notions of inversion proposed in the literature. To overcome this limitation, we borrow the notion of CQ-composition, which is a relaxation obtained by parameterizing the composition of mappings by the class of conjunctive queries (CQ), and we propose a restriction over the class of SO-tgds that gives rise to the language of plain SO-tgds. Then we show that plain SO-tgds are the right language to express the CQ-composition of mappings given by st-tgds, in the same sense that SO-tgds are the right language to express the composition of st-tgds, and we prove that every mapping specified by a plain SO-tgd admits a maximum recovery, thus showing that plain SO-tgds have a good behavior w.r.t. inversion. Moreover, we show that the language of plain SO-tgds shares some fundamental structural properties with the language of st-tgds, but being much more expressive, and we provide a polynomial-time algorithm to compute maximum recoveries for mappings specified by plain SO-tgds (which can also be used to compute maximum recoveries for mappings given by st-tgds). All these results suggest that the language of plain SO-tgds is a good alternative to be implemented in data exchange and data integration applications.

Strategic alignment of information quality management: problems and challenges

This paper focuses on the problems and challenges one faces when aligning management of information quality with different strategies and theories of operations. Such an alignment may change the focus, scope, and priorities in assessing how information quality and related risks impact results and subsequently change managing information quality. Strategic decisions are usually of irreparable even irreversible consequences, what requires articulation of additional distinctions in this domain. They will be assessed by the pragmatic material consequences of the difference in results with regard to the purpose of operations, a subject of natural semantics.