Results 171 to 180 of about 298,732 (229)
Some of the next articles are maybe not open access.
SOME NOTES ON PARALLEL COORDINATE GRAMMARS
International Journal of Pattern Recognition and Artificial Intelligence, 1995In a coordinate grammar, the rewriting rules replace sets of symbols having given coordinates by sets of symbols whose coordinates are given functions of the coordinates of the original symbols. Usually, at each step of a derivation, only one rule is applied and only one instance of its left hand side is rewritten.
openaire +2 more sources
A theory of syntactic recognition for natural language
, 1979: Assume that the syntax of natural language can be parsed by a left-to-right deterministic mechanism without facilities for parallelism or backup. It will be shown that this 'determinism' hypothesis, explored within the context of the grammar of English,
Mitchell P. Marcus
semanticscholar +1 more source
Probabilistic Parallel Communicating Grammar Systems
International Journal of Computer Mathematics, 2002Grammar 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.
Kamala Krithivasan, K. Arthi
openaire +2 more sources
Harmonic Serialism and Parallelism
, 2000“Universal grammar must also provide a function Gen that admits the candidates to be evaluated. In the discussion above we have entertained two different conceptions of Gen.
J. McCarthy
semanticscholar +1 more source
Parallel Grammars: A Short Phenomenology
2004It is simply impossible to cover all aspects of parallel grammars in the short space and time given to the subject here. We like to avoid repeating the material on classical L systems excellently presented in [3], [2, Vol. 1, Chapter 5] or [2, Vol. 3, Chapter 9].
openaire +2 more sources
Descriptional complexity of multi-parallel grammars
Information Processing Letters, 2008This paper studies the descriptional complexity of multi-parallel grammars with respect to the number of nonterminals and selectors, and the length of these selectors. As a result, it proves that every recursively enumerable language is generated by a multi-parallel grammar with no more than seven nonterminals and four selectors of length five.
openaire +2 more sources
On the synchronization in parallel communicating grammar systems [PDF]
Acta Informatica, 1993 We investigate the power of various types of synchronization in parallel communicating grammar systems. Systems without a universal clock (a pumping lemma is given for this case) proves in general to be weaker than the synchronized systems. Further synchronizing restrictions are introduced (added to the basic synchronization by a universal clock and ...
openaire +1 more source
The Feature Space in Parallel Grammar Writing
Research on Language and Computation, 2005This paper discusses the methodology and tools applied in the Parallel Grammar project (ParGram) to support consistency and parallelism of linguistic representations across multilingual Lexical Functional Grammar (lfg) grammars. A particular issue is that the grammars in the ParGram project are developed at different international sites.
Martin Forst +3 more
openaire +2 more sources
Syntactic Variation in Reduced Registers Through the Lens of the Parallel Architecture.
Topics in Cognitive ScienceDiversion from the syntactic norm, as manifested in the absence of otherwise expected lexical and syntactic material, has been extensively studied in theoretical syntax.
Anastasia Smirnova
semanticscholar +1 more source
Grammar-aware Parallelization for Scalable XPath Querying
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017Semi-structured data emerge in many domains, especially in web analytics and business intelligence. However, querying such data is inherently sequential due to the nested structure of input data. Existing solutions pessimistically enumerate all execution paths to circumvent dependencies, yielding sub-optimal performance and limited scalability.
Zhijia Zhao, Lin Jiang
openaire +1 more source