Results 151 to 160 of about 64,921 (192)

Vocabulary Opens the Door; Creativity Guides the Search: Complementary Contributions to Second Language Semantic Fluency Across Domains

Language Learning, EarlyView.
Abstract Semantic fluency, the ability to retrieve words within a category, relies on lexical knowledge, semantic memory and executive control mechanisms. A richer, interconnected semantic memory and optimal executive control, as seen in creative individuals, enhance fluency through broad associative searches and quicker access to remote concepts ...
Almudena Fernández‐Fontecha
wiley   +1 more source

Second Language Interactional Competence in Roleplay: Comparing Generative Artificial Intelligence and Human Interlocutors

Language Learning, EarlyView.
Abstract This study explores the potential of generative artificial intelligence (GenAI) as an alternative to human interlocutors for assessing interactional competence (IC) in a second language (L2). Thirty L2 English speakers completed a 6‐item roleplay task designed to elicit refusals of requests, invitations, and offers, interacting with both a ...
Yunwen Su, Xi Chen
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Parallel communicating grammar systems with negotiation

Fundamenta Informaticae, 1996
In a parallel communicating grammar system, several grammars work together, synchronously, on their own sentential forms, and communicate on request. No restriction is imposed usually about the communicated strings. We consider here two types of restrictions, as models of the negotiation process in multi-agent systems: (1) conditions formulated on the ...
Gheorghe Paun, Lech Polkowski, Andrzej Skowron   +2 more
openaire   +4 more sources

Probabilistic Parallel Communicating Grammar Systems

International Journal of Computer Mathematics, 2002
Grammar systems are theoretical models of distributed computing which play a major role in modern Computer Science. In this paper, we define and study a variant of Parallel Communicating(PC) grammar systems namely, Probabilistic PC grammar systems which serves as a grammatical model for random distributed processing.
K. Arthi, Kamala Krithivasan
openaire   +3 more sources

Further remarks on parallel communicating grammar systems

International Journal of Computer Mathematics, 1990
We continue the study of parallel communicating grammar systems introduced in P[acaron]un and Sântean [7] as a grammatical model of parallel computing. The investigated topics are: closure properties, the efficiency of generating a (linear) language by such a system compared with usual grammars, hierarchies.
Gheorghe Paun, Lila Santean
openaire   +3 more sources

On the generative capacity of parallel communicating grammar systems

International Journal of Computer Mathematics, 1992
The paper deals with synchronized and non-synchronized parallel communicating grammar systems (PCGS). Our results show, for instance, the high generative power of these mechanisms: one-letter non-regular and other non-semi-linear languages are generated by certain classes of PCGS's, mainly with regular components.
Gheorghe P[acaron]un, Sorina Vicolov, Arto Salomaa   +2 more
exaly   +5 more sources

Parallel Communicating Grammar Systems with Regular Control

Lecture Notes in Computer Science, 2009
Parallel communicating grammar systems with regular control (RPCGS, for short) are introduced, which are obtained from returning regular parallel communicating grammar systems by restricting the derivations that are executed in parallel by the various components through a regular control language. For the class of languages that are generated by RPCGSs
Dana Pardubská, Martin Plátek, Friedrich Otto   +2 more
openaire   +3 more sources

Parallel communicating grammar systems: the context-sensitive case

International Journal of Computer Mathematics, 1993
We prove that any recursively enumerable set can be generated by a returning synchronized parallel communicating grammar system of degree three, where one of its components is context-sensitive and the other two are regular (without using λ-rules). In the case that the rule S → λ is used in at least one component (S being the axiom), the returning or ...
O. Procopiuc, C. M. Ionescu, F. L. Tiplea   +2 more
openaire   +3 more sources

Parallel Communication Synchronized Pure Pattern Grammar Systems with Filters

2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011
Motivated by the study of pure pattern grammars by Abisha et al (2000), and parallel communicating grammar systems with communication by commands of Csuhaj -- Varju et al (2006), a new generative device, herein after referred as parallel communicating synchronizing pure pattern grammar systems with filters is introduced.
Sindhu J. Kumaar, P. J. Abisha
openaire   +3 more sources

Learning Subclasses of Parallel Communicating Grammar Systems

Lecture Notes in Computer Science, 2010
Pattern language learning algorithms within the inductive inference model and query learning setting have been of great interest. In this paper an algorithm to learn a parallel communicating grammar system in which the master component is a regular grammar and the other components are pure pattern grammars is given.
Sindhu J. Kumaar, P. J. Abisha, D. Gnanaraj Thomas   +2 more
openaire   +3 more sources