Results 211 to 220 of about 52,651 (265)

Iconicity and transparency in Dutch Sign Language. [PDF]

Behav Res Methods
Schiefner A, Roelofsen F, Sümer B.
europepmc   +1 more source

Legal, ethical, and policy challenges of artificial intelligence translation tools in healthcare. [PDF]

Discov Public Health
van Kolfschooten H, Goosen S, van Oirschot J, Schouten B, Vajda I, Willems L.   +5 more
europepmc   +1 more source

Risk Communication and Infodemic Misframing in <i>Legionella</i> spp. Environmental Surveillance: An Infodemiology Case Study. [PDF]

Microorganisms
Papadakis A, Koufakis E, Raptakis N, Pitsoulis G, Kamekis A, Chochlakis D, Psaroulaki A, Lagiou A.   +7 more
europepmc   +1 more source

CA-MuSiC: a Culture-Aware Multilingual Skill Cognition Model for MOOC review understanding. [PDF]

Front Psychol
Du G, Ma B, Liu Y.
europepmc   +1 more source

Predicting PANSS symptoms in schizophrenia spectrum disorders using speech only: an international, multi-centre, retrospective, computational study across multiple languages

He R, Kirdun M, Palominos C, Orejudo LN, Barthelemy S, Bhola S, Ciampelli S, Decker A, Demirlek C, Fusaroli R, García-Molina JT, Gimenez G, Hüppi R, Koelkebeck K, Lecomte A, Qiu R, Simonsen A, Tourneur V, Verim B, Wang H, Yalincetin B, Yin S, Zhou Y, Amblard M, Arriola RA, Bora E, de Boer J, Figueroa-Barra AI, Koops S, Musiol M, Palaniyappan L, Parola A, Spaniel F, Tang SX, Sommer IE, Homan P, Hinzen W.   +36 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Quotients of Context-Free Languages

Journal of the ACM, 1963
Abstract : The following results on the quotient of context free languages CFL are shown: (1) It is recursively unsolvable to determine for arbitrary CFL whether the quotient of one by another is a CFL. (2) If either set is regular and the other is a CFL, then the quotient is a CFL. (Author)
Seymour Ginsburg, Edwin H. Spanier
openaire   +2 more sources

Natural Languages and Context-Free Languages

Linguistics and Philosophy, 1982
In his 1956 paper ‘Three Models for the Description of Language’ Noam Chomsky posed an interesting open question: when we consider the human languages purely as sets of strings of words (henceforth stringsets), do they always fall within the class called context-free languages (CFL’s)?
Geoffrey K. Pullum, Gerald Gazdar
openaire   +1 more source

On Context-Free Languages

Journal of the ACM, 1966
In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular, questions regarding structure, possible ambiguity and relationship to finite automata are considered. The following results are presented: The language generated by a ...
openaire   +1 more source