Results 131 to 140 of about 27,468 (206)
Integration of large language models and federated learning. [PDF]
Patterns (N Y)Chen C +6 more
europepmc +1 more source
Soft locality restrictions in negative concord: Evidence from the French future polarity effect. [PDF]
Nat Lang Linguist TheoryLiang Y, Amsili P, Burnett H.
europepmc +1 more source
The instability mechanisms and precursor information of different type rocks based on acoustic emission. [PDF]
PLoS OneXue R, Kong Y, Feng J.
europepmc +1 more source
Parallelism in Contextual Grammars
Fundamenta Informaticae, 1998 Two strategies of parallel adjoining of contexts are considered for contextual grammars with choice. After a short comparison between them, there are provided Chomsky-Schutzenberger type characterizations of context-free and recursively enumerable languages. Finally, we discuss some decision problems.
Víctor Mitrana
openaire +3 more sources
CONTEXTUAL GRAMMARS: PARALLELISM AND BLOCKING OF DERIVATION
Fundamenta Informaticae, 1996 Continuing the work begun in [14], we consider contextual grammars (as introduced in [6] with linguistic motivation) with parallel derivations, in which the whole current string participates to a derivation step in the sense that it is splitted into substrings to which contexts are adjoined in a parallel manner.
Păun, Gheorghe +2 more
openaire +3 more sources
Universal grammar and syntax/phonology parallelisms
Lingua, 2006 Abstract I consider a set of putative parallels, often said to be given by UG, between phonology and (what is typically taken to constitute) syntax. These include the claim that syllable structure and sentence structure exhibit serious linguistic parallels [Pierrehumbert, J., 1990. Phonological and phonetic representation.
Philip Carr
+5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Parallel Processing of Grammar Compression
2021 Data Compression Conference (DCC), 2021Re-pair is a grammar-based compression algorithm. It achieves higher compression rates for text, graph, and tree than other general compression algorithms. While Re-pair is linear-time algorithm, it is slower than other algorithms in practice. In this paper, we present Parallel Re-pair, a novel variant that enables parallel processing of Re-pair.
Masaki Matsushita, Yasushi Inoguchi
openaire +1 more source
Parallel Communicating Graph Grammar
2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011In a Parallel Communicating Grammar System the components of a grammar system can also work in parallel (each having its own rewriting form) and communicate to each other in some way(sending the currently generated resultant graph to other components). In this paper we define parallel communicating edNCE graph grammar and parallel communicating ETPL(k)
S. Jeya Bharathi +2 more
openaire +1 more source