Results 171 to 180 of about 1,304 (204)
Language Learning, EarlyView.Abstract This study explores how word frequency affects verb‐mediated prediction in L1 and L2 speakers, using a visual‐world eye‐tracking task. By manipulating frequency of nouns within subjects (higher; lower) and type of verbs used as predictive cues (semantically restrictive; neutral) in sentences (e.g., The {doctor/surgeon} {opened/moved} the box),
Haerim Hwang, Kitaek Kim
wiley +1 more source
Language Learning, EarlyView.Abstract We investigate what is learned from exposure to usage in verbal morphology using an error correction mechanism within an associative learning framework. We computationally simulated how second language (L2) learners would respond to naturalistic input of aspectual usage, characterized by “imperfect contingencies,” given two types of ...
Justyna Mackiewicz +2 more
wiley +1 more source
Effective faking of verbal deception detection with target‐aligned adversarial attacks
Legal and Criminological Psychology, EarlyView.Abstract Background Deception detection through analysing language is a promising avenue using both human judgements and automated machine learning judgements. For both forms of credibility assessment, automated adversarial attacks that rewrite deceptive statements to appear truthful pose a serious threat.
Bennett Kleinberg +2 more
wiley +1 more source
On relating rewriting systems and graph grammars to event structures [PDF]
Dagstuhl Seminar on Graph Transformations in Computer Science, 1994 In this paper, we investigate how rewriting systems and especially graph grammars as operational models of parallel and distributed systems can be related to event structures as more abstract models. First, distributed rewriting systems that are based on the notion of contexts are introduced as a common framework for different kinds of rewriting ...
Georg Schied
semanticscholar +3 more sources
Array P systems and pure 2D context-free grammars with independent mode of rewriting [PDF]
Journal of Membrane Computing, 2021 Somnath Bera +3 more
semanticscholar +3 more sources
Graph grammars as context-dependent rewriting systems: A partial ordering semantics
Colloquium on Trees in Algebra and Programming, 1992 Context-dependent rewriting systems allow a higher degree of concurrency w.r.t. context-independent ones, since rewriting rules which apply in intersecting contexts and rewrite different items may be applied concurrently, while this cannot happen with a context-independent specification of the same rules. Context-dependent systems can also be seen as a
U. Montanari, ROSSI, FRANCESCA
semanticscholar +5 more sources
Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems
, 2010 Multiple Context-Free Grammars (MCFGs) have been introduced by Seki et al. (1991) while the equivalent Linear Context-Free Rewriting Systems (LCFRSs) were independently proposed by Vijay-Shanker, Weir, and Joshi (1987). The central idea is to extend CFGs such that non-terminal symbols can span a tuple of strings that need not be adjacent in the input ...
Laura Kallmeyer
semanticscholar +4 more sources
Unconventional Programming Paradigms, 2005 Relational growth grammars (RGG) area graph rewriting formalism which extends the notations and semantics of Lindenmayer systems and which allows the specification of dynamical processes on dynamical structures, parti cular ly in biological and chemical applications.
Winfried Kurth +2 more
semanticscholar +3 more sources
Array-Rewriting P Systems with Basic Puzzle Grammar Rules and Permitting Features
Int. Conf. on Membrane Computing, 2017 Motivated by the problem of tiling the plane, puzzle grammars were introduced as a mechanism for generating languages of picture arrays in the two-dimensional plane. On the other hand BPG array P system with array objects and basic puzzle grammar (BPG) rules was introduced as a variant of array generating P systems that were developed with a view to ...
Ravie Chandren Muniyandi +3 more
semanticscholar +3 more sources