Aggregation functions for typical hesitant fuzzy elements and the action of automorphisms

This work studies the aggregation operators on the set of all possible membership degrees of typical hesitant fuzzy sets, which we refer to as H, as well as the action of H-automorphisms which are defined over the set of all finite non-empty subsets of the unitary interval. In order to do so, the partial order ≤H, based on α-normalization, is introduced, leading to a comparison based on selecting the greatest membership degrees of the related fuzzy sets. Additionally, the idea of interval representation is extended to the context of typical hesitant aggregation functions named as the H-representation. As main contribution, we consider the class of finite hesitant triangular norms, studying their properties and analyzing the H-conjugate functions over such operators. © 2013 Elsevier Inc. All rights reserved.Peer Reviewe

An Abstract Machine for Unification Grammars

This work describes the design and implementation of an abstract machine, Amalia, for the linguistic formalism ALE, which is based on typed feature structures. This formalism is one of the most widely accepted in computational linguistics and has been used for designing grammars in various linguistic theories, most notably HPSG. Amalia is composed of data structures and a set of instructions, augmented by a compiler from the grammatical formalism to the abstract instructions, and a (portable) interpreter of the abstract instructions. The effect of each instruction is defined using a low-level language that can be executed on ordinary hardware. The advantages of the abstract machine approach are twofold. From a theoretical point of view, the abstract machine gives a well-defined operational semantics to the grammatical formalism. This ensures that grammars specified using our system are endowed with well defined meaning. It enables, for example, to formally verify the correctness of a compiler for HPSG, given an independent definition. From a practical point of view, Amalia is the first system that employs a direct compilation scheme for unification grammars that are based on typed feature structures. The use of amalia results in a much improved performance over existing systems. In order to test the machine on a realistic application, we have developed a small-scale, HPSG-based grammar for a fragment of the Hebrew language, using Amalia as the development platform. This is the first application of HPSG to a Semitic language.Comment: Doctoral Thesis, 96 pages, many postscript figures, uses pstricks, pst-node, psfig, fullname and a macros fil