Search

In recent years, the study of evaluative linguistic expressions has crossed the field of theoretical linguistics and has aroused interest in very different research areas such as artificial intelligence, psychology or cognitive linguistics. The interest in this type of expressions may be due to its relevance in applications such as opinion mining or sentiment analysis. This paper brings together Fuzzy Natural Logic and Fuzzy Property Grammars to approach evaluative expressions. Our contribution includes the marriage of mathematical and linguistic methods for providing a formalism to deal with the linguistic vagueness of evaluative expressions by describing the syntax and semantics of these structures. We contribute to the study of evaluative linguistic expressions by proposing a formal characterization of them where the concepts of semantic prime, borderline evaluative expressions and markedness are defined and where the relation between the semantic constraints of evaluations and their sentiment can be established. A proof-of-concept of how to create a lexicon of evaluative expressions for future computational applications is presented. The results demonstrate that linguistic evaluative expressions are gradient, have sentiment, and that the evaluations work as a relation of hypernym and hyponym, the hypernym being a semantic prime. Our findings provide the basis for building an ontology of evaluative expressions for future computational applications.

The paper focuses on linguistic complexity and language universals, which are two important and controversial issues in language research. A Fuzzy Property Grammar for determining the degree of universality and complexity of a natural language is introduced. In this task, the Fuzzy Property Grammar operated only with syntactic constraints. Fuzzy Natural Logic sets the fundamentals to express the notions of universality and complexity as evaluative expressions. The Fuzzy Property Grammar computes the constraints in terms of weights of universality and calculates relative complexity. We present a proof-of-concept in which we have generated a grammar with 42B syntactic constraints. The model classifies constraints in terms of low, medium, and high universality and complexity. Degrees of relative complexity in terms of similarity from a correlation matrix have been obtained. The results show that the architecture of a Universal Fuzzy Property Grammar is flexible, reusable, and re-trainable, and it can easily take into account new sets of languages, perfecting the degree of universality and complexity of the linguistic constraints as well as the degree of complexity between languages.