Results 81 to 90 of about 510 (156)
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.
Gheorghe P checkA un +2 more
openalex +4 more sources
Parallelism in Contextual Grammars
Fundamenta Informaticae, 1998 Summary: Two strategies of parallel adjoining of contexts are considered for contextual grammars with choice. After a short comparison between them, there are provided Chomsky-Schützenberger type characterizations of context-free and recursively enumerable languages. Finally, we discuss some decision problems.
Víctor Mitrana
openalex +4 more sources
Universal grammar and syntax/phonology parallelisms
Lingua, 2004 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
openalex +4 more sources
Restricted Parallelism and Regular Grammars
, 1972 This thesis studies the properties of k-parallel right-linear languages. An infinite hierarchy of language families is found and closure properties of these families are studied. The language families are characterised in terms of simple languages and non-deterministic generalised sequential machine mappings.
Robert D. Rosenbrugh
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 +2 more sources
Parallel grammars: A phenomenology [PDF]
Grammars, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Fernau, Henning Fernau
openaire +1 more source
Vertical Grammar of Parallelism in Hebrew Poetry
Journal of Biblical Literature, 2009 Tsumura
openalex +3 more sources
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