Results 151 to 160 of about 298,732 (229)
Some of the next articles are maybe not open access.
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 +2 more sources
Parallelism between Linguistics and Music – Noam Chomsky and Heinrich Schenker
, 2021The paper aims to compare musical language with verbal language, creating a new perspective on music and natural language. The three categories of linguistics, phonology, syntax and semantics are analyzed.
Botond Szőcs
semanticscholar +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
Rina S. Cohen, B. O. Nash
openaire +2 more sources
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
Rina S. Cohen, B. O. Nash
openaire +2 more sources
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 +4 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)
M. Saravana Vadivu +2 more
openaire +2 more sources
Parallel evaluation of attribute grammars
IEEE Transactions on Parallel and Distributed Systems, 1992Examines the generation of parallel evaluators for attribute grammars, targeted to shared-memory MIMD computers. Evaluation-time overhead due to process scheduling and synchronization is reduced by detecting coarse-grain parallelism (as opposed to the naive one-process-per-node approach).
Alexander C. Klaiber, Maya Gokhale
openaire +2 more sources
Parallel schedule synthesis for attribute grammars
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming, 2013We examine how to synthesize a parallel schedule of structured traversals over trees. In our system, programs are declaratively specified as attribute grammars. Our synthesizer automatically, correctly, and quickly schedules the attribute grammar as a composition of parallel tree traversals. Our downstream compiler optimizes for GPUs and multicore CPUs.
Rastislav Bodik +3 more
openaire +1 more source
Parallel Grammars and Computation
2017Originally, computer programs were always executed strictly sequentially. Indeed, to perform a computational task, an algorithm was written and implemented as an instruction sequence executed on a central processing unit on a single computer. Only one instruction was executed at a time, so after this instruction was completed, the next instruction was ...
Alexander Meduna, Ondřej Soukup
openaire +2 more sources
Parallel parsing of operator precedence grammars
Information Processing Letters, 2013Operator precedence grammars, introduced by Floyd several decades ago, enjoy properties that make them very attractive to face problems and to exploit technologies highly relevant in these days. In this paper we focus on their local parsability property, i.e., the fact that any substring s of a longer one x.s.y can be parsed independently of its ...
BARENGHI, ALESSANDRO +3 more
openaire +3 more sources
ON COMPETENCE IN CD GRAMMAR SYSTEMS WITH PARALLEL REWRITING
International Journal of Foundations of Computer Science, 2007We continue our investigation of the generative power of cooperating distributed grammar systems (CDGSs), using the previously introduced ≤k-, =k-, and ≥k-competence-based cooperation strategies and context-free components that rewrite the sentential form in a parallel manner.
Ter Beek M H +3 more
openaire +3 more sources