Results 31 to 40 of about 8,860,193 (293)
On Müller Context-Free Grammars
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zoltán Ésik, Szabolcs Iván
openaire +3 more sources
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
Acta Cybernetica, 2015 Jungles generalize trees by sharing subtrees and allowing garbage. It is shown that IO context-free tree grammars generate the same jungle languages as context-free jungle grammars.
Drewes, F., Engelfriet, J.
openaire +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
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
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
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
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
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.
Armin B. Cremers, Seymour Ginsburg
openaire +2 more sources
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
Superregular grammars do not provide additional explanatory power but allow for a compact analysis of animal song [PDF]
Royal Society Open Science, 2019 A pervasive belief with regard to the differences between human language and animal vocal sequences (song) is that they belong to different classes of computational complexity, with animal song belonging to regular languages, whereas human language is ...
T. Morita, H. Koda
doaj +1 more source