Results 11 to 20 of about 176,605 (340)
Translations on a context free grammar [PDF]
Symposium on the Theory of Computing, 1969 A. Aho, J. Ullman
semanticscholar +2 more sources
Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding. [PDF]
J Math Biol, 2014 Poznanović S, Heitsch CE.
europepmc +3 more sources
Learning of Structurally Unambiguous Probabilistic Grammars [PDF]
Logical Methods in Computer Science, 2023 The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule.
Dana Fisman +2 more
doaj +1 more source
Split-Based Algorithm for Weighted Context-Free Grammar Induction
Applied Sciences, 2021 The split-based method in a weighted context-free grammar (WCFG) induction was formalised and verified on a comprehensive set of context-free languages. WCFG is learned using a novel grammatical inference method. The proposed method learns WCFG from both
Mateusz Gabor +2 more
doaj +1 more source
Learning Cover Context-Free Grammars from Structural Data [PDF]
Scientific Annals of Computer Science, 2014 We consider the problem of learning an unknown context-free gram- mar from its structural descriptions with depth at most ℓ. The structural descriptions of the context-free grammar are its unlabelled derivation trees. The goal is to learn a cover context-
M. Marin, G. Istrate
doaj +1 more source
Compound Probabilistic Context-Free Grammars for Grammar Induction [PDF]
Annual Meeting of the Association for Computational Linguistics, 2019 We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our context-free rule ...
Yoon Kim, Chris Dyer, Alexander M. Rush
semanticscholar +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
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
Baboons (Papio papio) Process a Context-Free but Not a Context-Sensitive Grammar
Scientific Reports, 2020 Language processing involves the ability to master supra-regular grammars, that go beyond the level of complexity of regular grammars. This ability has been hypothesized to be a uniquely human capacity.
R. Malassis, S. Dehaene, J. Fagot
semanticscholar +1 more source
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