Results 31 to 40 of about 445,078 (279)
Fuzzing With Optimized Grammar-Aware Mutation Strategies
Fuzzing is a widely used technique to discover vulnerabilities in software. However, for programs requiring highly structured inputs, the byte-based mutation strategies in existing fuzzers have difficulties in generating valid inputs.
Jiale Deng +5 more
doaj +1 more source
Consistent Unsupervised Estimators for Anchored PCFGs
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
This paper introduces a new resource designed to facilitate the quantitative investigation of syntactic variation in spoken language from a comparative perspective.
Anette Rosenbach +5 more
doaj +2 more sources
Empirical Risk Minimization with Approximations of Probabilistic Grammars [PDF]
Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. We present a framework, reminiscent of structural risk minimization, for empirical risk minimization of the parameters of a fixed ...
Smith, N. A., Cohen, S. B.
core +2 more sources
Exploring a diverse world of effector domains and amyloid signaling motifs in fungal NLR proteins.
NLR proteins are intracellular receptors constituting a conserved component of the innate immune system of cellular organisms. In fungi, NLRs are characterized by high diversity of architectures and presence of amyloid signaling.
Jakub W Wojciechowski +8 more
doaj +1 more source
On Repair with Probabilistic Attribute Grammars
Program synthesis and repair have emerged as an exciting area of research, driven by the potential for revolutionary advances in programmer productivity. Among most promising ideas emerging for synthesis are syntax-driven search, probabilistic models of code, and the use of input-output examples.
Manos Koukoutos +3 more
openaire +2 more sources
Computation of infix probabilities for probabilistic context-free grammars [PDF]
The notion of infix probability has been introduced in the literature as a generalization of the notion of prefix (or initial substring) probability, motivated by applications in speech recognition and word error correction.
Satta, Giorgio +5 more
core +2 more sources
Background RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs).
Eddy Sean R, Dowell Robin D
doaj +1 more source
Analysing symbolic music with probabilistic grammars [PDF]
Recent developments in computational linguistics offer ways to approach the analysis of musical structure by inducing probabilistic models (in the form of grammars) over a corpus of music.
Marsden, Alan +2 more
core +4 more sources
Prefix probabilities for linear context-free rewriting systems [PDF]
We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and
Satta, Giorgio, Nederhof, Mark Jan
core +2 more sources

