Results 21 to 30 of about 8,860,193 (293)
Modern Standard Arabic Grammar Automatic Extraction from Penn 1 Arabic Treebank Using Natural Language Toolkit [PDF]
The Egyptian Journal of Language Engineering, 2018 This paper presents a methodology for rule based bottom up parsing technique forModern Standard Arabic (MSA) inContext Free Grammar (CFG) formalism in Phrase Structure Grammar (PSG) representation, where the grammar isautomatically extracted from a ...
Amira Abdelhalim, Sameh Alansary
doaj +1 more source
Undecidable problems concerning densities of languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In this paper we prove that the question whether a language presented by a context free grammar has density, is undecidable. Moreover we show that there is no algorithm which, given two unambiguous context free grammars on input, decides whether the ...
Jakub Kozik
doaj +1 more source
A Context-Free Grammar Associated with Fibonacci and Lucas Sequences
Journal of Mathematics, 2023 We introduce a context-free grammar G=s⟶s+d,d⟶s to generate Fibonacci and Lucas sequences. By applying the grammar G, we give a grammatical proof of the Binet formula.
Harold Ruilong Yang
doaj +1 more source
Mathematics, 2022 The limitations of traditional parsing architecture are well known. Even when paired with parsing methods that accept all context-free grammars (CFGs), the resulting combination for any given CFG accepts only a limited subset of corresponding character ...
Žiga Leber +3 more
doaj +1 more source
Prefix probabilities for linear context-free rewriting systems [PDF]
, 2011 We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and
Satta, Giorgio +2 more
core +2 more sources
Computation of infix probabilities for probabilistic context-free grammars [PDF]
, 2011 The notion of infix probability has been introduced in the literature as a generalization of the notion of prefix (or initial substring) probability, motivated by applications in speech recognition and word error correction.
Satta, Giorgio +4 more
core +2 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
On Restricted Context-Free Grammars
Journal of Computer and System Sciences, 2010 The contribution investigates the generative power of several derivation-restricted context-free grammars. Many derivation restriction mechanisms for context-free grammars have already been studied in the literature, and the current contribution investigates a restriction on the non-terminals that allows/disallows the application of a production ...
Jürgen Dassow, Tomás Masopust
openaire +6 more sources
A Context-Free Grammar of One Rhythmic Model of Russian Verse
Моделирование и анализ информационных систем, 2012 A formal model of the Russian verse based on the accentual segmentation of its structure is offered and considered. A context-free grammar (in N. Chomsky’s sense) which generates correct rhythmic forms of the presented model is constructed.
V. N. Boykov
doaj +3 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