Results 231 to 240 of about 10,677,937 (263)
Some of the next articles are maybe not open access.

Password Cracking Using Probabilistic Context-Free Grammars

2009 30th IEEE Symposium on Security and Privacy, 2009
Choosing the most effective word-mangling rules to use when performing a dictionary-based password cracking attack can be a difficult task. In this paper we discuss a new method that generates password structures in highest probability order. We first automatically create a probabilistic context-free grammar based upon a training set of previously ...
Sudhir Aggarwal
exaly   +2 more sources

Iterative CKY Parsing for Probabilistic Context-Free Grammars

2005
This paper presents an iterative CKY parsing algorithm for probabilistic context-free grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing, which results in more efficient parsing. Since pruning is done by using the edge's inside Viterbi probability and the upper-bound of the outside Viterbi probability, this ...
Yoshimasa Tsuruoka, Jun'ichi Tsujii
openaire   +1 more source

The Use of Context-Free Probabilistic Grammar to Anonymise Statistical Data

Cybernetics and Systems, 2020
In the following article, a proprietary method of anonymisation of identifiable statistical data using context-free probabilistic grammar is proposed.
Zygmunt Mazur, Janusz Pec
openaire   +2 more sources

Parsing Arabic using induced probabilistic context free grammar

International Journal of Speech Technology, 2015
The importance of the parsing task for NLP applications is well understood. However developing parsers remains difficult because of the complexity of the Arabic language. Most parsers are based on syntactic grammars that describe the syntactic structures of a language. The development of these grammars is laborious and time consuming.
Nabil Khoufi   +2 more
openaire   +2 more sources

Inducing Probabilistic Context-Free Grammars for the Sequencing of Movement Primitives

2018 IEEE International Conference on Robotics and Automation (ICRA), 2018
Movement Primitives are a well studied and widely applied concept in modern robotics. Composing primitives out of an existing library, however, has shown to be a challenging problem. We propose the use of probabilistic context-free grammars to sequence a series of primitives to generate complex robot policies from a given library of primitives.
Rudolf Lioutikov   +4 more
openaire   +3 more sources

Basic Methods of Probabilistic Context Free Grammars

1992
In automatic speech recognition, language models can be represented by Probabilistic Context Free Grammars (PCFGs). In this lecture we review some known algorithms which handle PCFGs; in particular an algorithm for the computation of the total probability that a PCFG generates a given sentence (Inside), an algorithm for finding the most probable parse ...
F. Jelinek, J. D. Lafferty, R. L. Mercer
openaire   +1 more source

The Generative Power of Probabilistic and Weighted Context-Free Grammars

2011
Over the last decade, probabilistic parsing has become the standard in the parsing literature where one of the purposes of those probabilities is to discard unlikely parses. We investigate the effect that discarding low probability parses has on both the weak and strong generative power of context-free grammars. We prove that probabilistic context-free
openaire   +2 more sources

Prefix Probability for Probabilistic Synchronous Context-Free Grammars.

2011
We present a method for the computation of prefix probabilities for synchronous context-free grammars. Our framework is fairly general and relies on the combination of a simple, novel grammar transformation and standard techniques to bring grammars into normal forms.
NEDERHOF M. J, SATTA, GIORGIO
openaire   +2 more sources

Probabilistic Grammars for Equation Discovery

Knowledge-Based Systems, 2021
Jure Brence   +2 more
exaly  

Home - About - Disclaimer - Privacy