Results 21 to 30 of about 304,382 (268)
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
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
Multiple Context-Free Tree Grammars: Lexicalization and Characterization [PDF]
, 2017 Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one ...
Engelfriet, Joost +2 more
core +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
Restricted Global Grammar Constraints [PDF]
, 2009 We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as hard as parsing ...
Katsirelos, George +3 more
core +3 more sources
A survey of normal form covers for context-free grammars [PDF]
, 1980 An overview is given of cover results for normal forms of context-free grammars. The emphasis in this paper is on the possibility of constructing ɛ-free grammars, non-left-recursive grammars and grammars in Greibach normal form. Among others it is proved
Nijholt, Anton
core +4 more sources
Spurious Ambiguity and Focalization [PDF]
Computational Linguistics, 2018 Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing.
Glyn Morrill, Oriol Valentín
doaj +1 more source
Absence of phase transition in random language model
Physical Review Research, 2022 The random language model, proposed as a simple model of human languages, is defined by the averaged model of a probabilistic context-free grammar. This grammar expresses the process of sentence generation as a tree graph with nodes having symbols as ...
Kai Nakaishi, Koji Hukushima
doaj +1 more source
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
Equivalent Transformations and Regularization in Context-Free Grammars
Cybernetics and Information Technologies, 2015 Regularization of translational context-free grammar via equivalent transformations is a mandatory step in developing a reliable processor of a formal language defined by this grammar.
Fedorchenko Ludmila, Baranov Sergey
doaj +1 more source