All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Describing Linguistic Vagueness of Evaluative Expressions Using Fuzzy Natural Logic and Linguistic Constraints

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F22%3AA2302IAF" target="_blank" >RIV/61988987:17610/22:A2302IAF - isvavai.cz</a>

  • Result on the web

    <a href="https://www.mdpi.com/2227-7390/10/15/2760" target="_blank" >https://www.mdpi.com/2227-7390/10/15/2760</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3390/math10152760" target="_blank" >10.3390/math10152760</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Describing Linguistic Vagueness of Evaluative Expressions Using Fuzzy Natural Logic and Linguistic Constraints

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

    <a href="/en/project/EF18_053%2F0017856" target="_blank" >EF18_053/0017856: Strengthening the university's scientific capacities II</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Mathematics

  • ISSN

    2227-7390

  • e-ISSN

  • Volume of the periodical

  • Issue of the periodical within the volume

    15

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    24

  • Pages from-to

    1-24

  • UT code for WoS article

    000839937300001

  • EID of the result in the Scopus database

    2-s2.0-85136816737