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”

A Fuzzy Grammar for Evaluating Universality and Complexity in Natural Language

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Fuzzy Grammar for Evaluating Universality and Complexity in Natural Language

  • Original language description

    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.

  • 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

  • Continuities

    S - Specificky vyzkum na vysokych skolach

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

    10

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    23

  • Pages from-to

  • UT code for WoS article

    000839759500001

  • EID of the result in the Scopus database

    2-s2.0-85136800195