Publ3 search

Error:

Javascript is disabled in this browser. This page requires Javascript. Modify your browser's settings to allow Javascript to execute. See your browser's documentation for specific instructions.

Publikační činnost

Probíhá načítání, čekejte prosím...

Typ záznamu * :	článek v odborném periodiku (J)
Domácí pracoviště * :	Ústav pro výzkum a aplikace fuzzy modelování (94410)
Název * :	A Fuzzy Grammar for Evaluating Universality and Complexity in Natural Language
Citace :	Torrens-Urrutia, A., Jiménez-López, M. D., Brosa-Rodríguez, A. a Adamczyk, D. A Fuzzy Grammar for Evaluating Universality and Complexity in Natural Language. Mathematics. 2022, 15(10), ISSN 2227-7390.

Podnázev :
Rok * :	2022
Obor * :	Obecná matematika
Kód ISSN * :	2227-7390
Oficiální název periodika * :	Mathematics
Stát vydavatele periodika * :	Švýcarská konfederace
Svazek periodika * :	15
Číslo periodika v rámci svazku * :	10
Číslo článku :
Ročník :
Počet stran článku * :	23
Strana od * :	neuvedeno
Strana do * :	neuvedeno
Kód UT WoS :	000839759500001
EID :	2-s2.0-85136800195
Poddruh recenzovaného článku :	Článek v impaktovaném časopise (Jimp)

Klíčová slova anglicky * :	linguistic universals; linguistic complexity; evaluative expressions; fuzzy grammar; linguistic gradience; linguistic constraints
Popis 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.
Popis v anglické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.

Typ zdroje financování výsledku * :

Specifický výzkum

Seznam projektů :

ID Projektu	Název projektu

Seznam ohlasů :

Ohlas

R01:	RIV/61988987:17610/22:A2302G3V

Complementary Content

${loading}