Results 21 to 30 of about 176,605 (340)
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
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
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
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 +1 more source
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
Complexity of Problems of Commutative Grammars [PDF]
Logical Methods in Computer Science, 2015 We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an assumption that the ...
Eryk Kopczynski
doaj +1 more source
Fatgraph models of RNA structure
Computational and Mathematical Biophysics, 2017 In this review paper we discuss fatgraphs as a conceptual framework for RNA structures. We discuss various notions of coarse-grained RNA structures and relate them to fatgraphs.We motivate and discuss the main intuition behind the fatgraph model and ...
Huang Fenix +2 more
doaj +1 more source
Consistent Unsupervised Estimators for Anchored PCFGs
Transactions of the Association for Computational Linguistics, 2020 Learning probabilistic context-free grammars (PCFGs) from strings is a classic problem in computational linguistics since Horning ( 1969 ). Here we present an algorithm based on distributional learning that is a consistent estimator for a large class of ...
Clark, Alexander, Fijalkow, Nathanaël
doaj +1 more source