Results 21 to 30 of about 170,686 (340)
Baboons (Papio papio) Process a Context-Free but Not a Context-Sensitive Grammar
Scientific Reports, 2020 Language processing involves the ability to master supra-regular grammars, that go beyond the level of complexity of regular grammars. This ability has been hypothesized to be a uniquely human capacity.
R. Malassis, S. Dehaene, J. Fagot
semanticscholar +1 more source
On Restricted Context-Free Grammars
Journal of Computer and System Sciences, 2010 AbstractContext-free grammars are widely used for the simple form of their rules. A derivation step consists of the choice of a nonterminal of the sentential form and of an application of a rule rewriting it. Several regulations of the derivation process have been studied to increase the power of context-free grammars.
Dassow, J., Masopust, T. (Tomáš)
openaire +4 more sources
Grammar Compression with Probabilistic Context-Free Grammar [PDF]
2020 Data Compression Conference (DCC), 2020 We propose a new approach for universal lossless text compression, based on grammar compression. In the literature, a target string $T$ has been compressed as a context-free grammar $G$ in Chomsky normal form satisfying $L(G) = \{T\}$. Such a grammar is often called a \emph{straight-line program} (SLP).
Hiroaki Naganuma +4 more
openaire +3 more sources
Algorithms, 2016 LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source
Binary Context-Free Grammars [PDF]
Symmetry, 2020 A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a set of pairs of productions and the pair of the initial nonterminals that generates the binary relation, i.e., the set of pairs of strings over the terminal alphabets.
Sherzod Turaev +4 more
openaire +2 more sources
Synthesis of nested loop exercises for practice in introductory programming
Egyptian Informatics Journal, 2023 Novice programmers struggle to comprehend specific programming constructs such as arrays, recursion, and loops. One way to address this challenge is to provide practice problems for students in these topics that are considered difficult to comprehend ...
Chinedu Wilfred Okonkwo +1 more
doaj +1 more source
A Wide-Coverage Context-Free Grammar for Icelandic and an Accompanying Parsing System
Recent Advances in Natural Language Processing, 2019 We present an open-source, wide-coverage context-free grammar (CFG) for Icelandic, and an accompanying parsing system. The grammar has over 5,600 nonterminals, 4,600 terminals and 19,000 productions in fully expanded form, with feature agreement ...
V. Thorsteinsson +2 more
semanticscholar +1 more source
Journal of Computer and System Sciences, 1974 In an attempt to provide a unified theory of grammars, a model is introduced which has two components. The first is a ''grammar form,'' which provides the general structure of the productions in the grammars to be defined. The second is an ''interpretation'', which yields a specific grammar.
Seymour Ginsburg, Armin B. Cremers
openaire +3 more sources
Information and Control, 1978 In this paper we develop a theory of context-free graph grammars. Formal properties of such grammars are proven, with particular attention to graph language recognizability.
Pierluigi Della Vigna, GHEZZI, CARLO
openaire +1 more source
Context Free Grammar (CFG) Analysis for simple Kannada sentences
, 2010 B. M. Sagar, Ramakanth Kumar P, Shobha G
openalex +2 more sources