Results 31 to 40 of about 170,686 (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
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
Block-based syntax from context-free grammars
Software Language Engineering, 2020 Block-based programming systems employ a jigsaw metaphor to write programs. They are popular in the domain of programming education (e.g., Scratch), but also used as a programming interface for end-users in other disciplines, such as arts, robotics, and ...
M. V. Merino, T. Storm
semanticscholar +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
Cooperation in context-free grammars
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Dassow +2 more
openaire +2 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
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
Reduction of context-free grammars
Information and Control, 1970 This paper is concerned with the following problem: Given a context-free grammar G, find a context-free grammar with the fewest nonterminal symbols or with the fewest rules that is equivalent to G. A reduction procedure is presented for finding such a reduced context-free grammar that is structurally equivalent to a given G.
Tadao Kasami, Kenichi Taniguchi
openaire +3 more sources
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