A Fuzzy Grammar for Evaluating Universality and Complexity in Natural Language
Identifikátory výsledku
Kód výsledku v 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>
Výsledek na webu
<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>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
A Fuzzy Grammar for Evaluating Universality and Complexity in Natural Language
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
A Fuzzy Grammar for Evaluating Universality and Complexity in Natural Language
Popis výsledku anglicky
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.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10102 - Applied mathematics
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2022
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Mathematics
ISSN
2227-7390
e-ISSN
—
Svazek periodika
—
Číslo periodika v rámci svazku
10
Stát vydavatele periodika
CH - Švýcarská konfederace
Počet stran výsledku
23
Strana od-do
—
Kód UT WoS článku
000839759500001
EID výsledku v databázi Scopus
2-s2.0-85136800195