NASALIZATION IN BALINESE VERBS/PENASALAN VERBA BAHASA BALI

Balinese has two forms in relation to nasal pre xes. First, the initial segment of the verb root can be assimilated with the homorganic nasal and both coalesce. Second, the nasal pre x still assimilates with the rst segment of the verb root but forms a CC cluster. The data source of this study is Balinese dictionaries and analyzed by Optimality Theoretic (OT) so it was found that the af x nasal did not form a cluster with the rst segment of the verb root uniformly occurred in verbs where the rst segment is obstruent both voiced and voiceless while the one forming the cluster is the rst segment of a verb root which is realized by a sonorant. The rst phenomenon can be handled by the constraint * NC (obs) while the second one by violates linearity constraint, namely, Align-L (root) constraint. OT analysis also predicts that the ungrammaticality of an output verb structure ngmaang ‘to give’ due to fact that the correct underlying form baang is confused with its corresponding surface form. Keywords: nasalization, obstruent, sonorant, OT analysis Abstrak Bahasa Bali mempunyai dua bentuk dalam kaitannya dengan pre x nasal. Pertama, segmen awal dari akar verba bisa berasimilasi dengan nasal yang homorganik dan keduanya berkoalisi. Kedua, nasal pre ks masih berasimilasi dengan segmen pertama akar verba, tetapi membentuk klaster CC. Sumber data penelitian ini adalah Kamus Bahasa Bali dan dianalisis dengan Optimality Theoretic (OT) sehingga didapatkan bahwa nasal a ks yang tidak membentuk klaster dengan segmen pertama akar verba secara seragam hanya terjadi pada verba yang mana segmen pertamanya adalah obstruent, baik bersuara maupun tak bersuara sedangkan yang membentuk klaster adalah segmen pertama verba yang direalisasikan oleh segmen bertipe sonorant. Yang pertama bisa ditangani oleh konstrein *NC (obs), sedangkan yang kedua adalah secara jelas melangggar konstrein linieritas, yaitu Align-L (root). Analisis OT juga memprediksi ketidakgramatikalan bentuk-output verba ngmaang ‘memberi’ yang bentuk dasarnya yang benar adalah baang dikacaukan dengan bentuk output-nya. Kata kunci: penasalan, hambatan, sonoran, Analisis OT

A hierarchical cosimulation algorithm integrated with an acceptance–rejection method for the geostatistical modeling of variables with inequality constraints

This work addresses the problem of the cosimulation of cross-correlated variables with inequality constraints. A hierarchical sequential Gaussian cosimulation algorithm is proposed to address this problem, based on establishing a multicollocated cokriging paradigm; the integration of this algorithm with the acceptance–rejection sampling technique entails that the simulated values first reproduce the bivariate inequality constraint between the variables and then reproduce the original statistical parameters, such as the global distribution and variogram. In addition, a robust regression analysis is developed to derive the coefficients of the linear function that introduces the desired inequality constraint. The proposed algorithm is applied to cosimulate Silica and Iron in an Iron deposit, where the two variables exhibit different marginal distributions and a sharp inequality constraint in the bivariate relation. To investigate the benefits of the proposed approach, the Silica and Iron are cosimulated by other cosimulation algorithms, and the results are compared. It is shown that conventional cosimulation approaches are not able to take into account and reproduce the linearity constraint characteristics, which are part of the nature of the dataset. In contrast, the proposed hierarchical cosimulation algorithm perfectly reproduces these complex characteristics and is more suited to the actual dataset.

Interaction Systems I: The theory of optimal reductions

We introduce a new class of higher order rewriting systems, called Interaction Systems (IS's). IS's are derived from Lafont's (Intuitionistic) Interaction Nets (Lafont 1990) by dropping the linearity constraint. In particular, we borrow from Interaction Nets the syntactical bipartitions of operators into constructors and destructors and the principle of binary interaction. As a consequence, IS's are a subclass of Klop's Combinatory Reduction Systems (Klop 1980), where the Curry-Howard analogy still ‘makes sense’. Destructors and constructors, respectively, correspond to left and right logical introduction rules: interaction is cut and reduction is cut-elimination.Interaction Systems have been primarily motivated by the necessity of extending the practice of optimal evaluators for λ-calculus (Lamping 1990; Gonthier et al. 1992a) to other computational constructs such as conditionals and recursion. In this paper we focus on the theoretical aspects of optimal reductions. In particular, we generalize the family relation in Lévy (1978; 1980), thus defining the amount of sharing an optimal evaluator is required to perform. We reinforce our notion of family by approaching it in two different ways (generalizing labelling and extraction in Levy (1980)) and proving their coincidence. The reader is referred to Asperti and Laneve (1993c) for the paradigmatic description of optimal evaluators of IS's.