Results 131 to 140 of about 26,922 (200)
Vertical Grammar of Parallelism in Biblical Hebrew
, 2023 David Toshio Tsumura
openalex +2 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
Construction Morphology and the Parallel Architecture of Grammar
Cognitive Science, 2015AbstractThis article presents a systematic exposition of how the basic ideas of Construction Grammar (CxG) (Goldberg, ) and the Parallel Architecture (PA) of grammar (Jackendoff, ) provide the framework for a proper account of morphological phenomena, in particular word formation. This framework is referred to as Construction Morphology (CxM).
Booij, G.E., Audring, J.
openaire +3 more sources
ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS
International Journal of Foundations of Computer Science, 2007A generalization of centralized and returning parallel communicating grammar systems with linear components (linear CPC grammar systems) is studied. It is known that linear CPC grammar systems are more powerful than regular CPC grammar systems and that CPC grammar systems with context-free components are more powerful than linear CPC grammar systems ...
Malcher, Andreas, Sunckel, Bettina
openaire +1 more source
10th Annual Symposium on Switching and Automata Theory (swat 1969), 1969
A new type of grammar, called a parallel leveled grammar, is introduced. The families of languages generated by such grammars with contextfree, linear or right-linear subrules are studied. Right-linear parallel finite-leveled languages can be displayed as nested vector expressions, which are extensions of regular expressions. Various hierarchy theorems
B. O. Nash, Rina S. Cohen
openaire +1 more source
A new type of grammar, called a parallel leveled grammar, is introduced. The families of languages generated by such grammars with contextfree, linear or right-linear subrules are studied. Right-linear parallel finite-leveled languages can be displayed as nested vector expressions, which are extensions of regular expressions. Various hierarchy theorems
B. O. Nash, Rina S. Cohen
openaire +1 more source
Parallel Grammars: A Phenomenology
Grammars, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On Descriptional Complexity of Partially Parallel Grammars
Fundamenta Informaticae, 2008This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a four-nonterminal scattered context grammar with no more than four non-context-free productions, (ii) by a two-nonterminal multisequential grammar with no ...
Masopust, Tomáš, Meduna, Alexander
openaire +2 more sources
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
Parallel Composition of Graph Grammars
Applied Categorical Structures, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources