Results 21 to 30 of about 10,677,937 (263)
Bayesian Finite Mixture Models for Probabilistic Context-Free Grammars
Instead of using a common PCFG to parse all texts, we present an efficient generative probabilistic model for the probabilistic context-free grammars(PCFGs) based on the Bayesian finite mixture model, where we assume that there are several PCFGs and each of these PCFGs share the same CFG but with different rule probabilities.
Tang, Y, Yu, PLH
openaire +3 more sources
Compound Probabilistic Context-Free Grammars for Grammar Induction [PDF]
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 grammar's rule probabilities are modulated by a per-sentence continuous latent variable, which induces marginal ...
Yoon Kim, Chris Dyer, Alexander M. Rush
openaire +3 more sources
A method of failure detection in telecommunication networks is presented. This is a meta-method that correlates alarms raised by failure-detection modules based on various philosophies. The correlation takes into account two main characteristics of each
Paweł Białoń
doaj +1 more source
A Theoretical Foundation for Syntactico-Semantic Pattern Recognition
Conventionally syntactic pattern recognition tasks have been driven by grammars defining a syntactic structure. Syntactic Pattern recognition tasks were primarily relying on the ability of parsing algorithms to recognize the patterns in the input data ...
Shrinivasan Patnaikuni, Sachin Gengaje
doaj +1 more source
Behavior modeling with probabilistic context free grammars [PDF]
Identifying the behavioral patterns in a social network setting is beneficial to understand how people behave in certain application domains. Such patterns can also be utilized to characterize social signals such as social roles from interactions.
Sahin Cem Geyik +2 more
openaire +2 more sources
Using Probabilistic Context-Free Grammar to Create Password Guessing Models [PDF]
This paper will discuss two versions of probabilistic context-free grammar password-guessing models. The first model focuses on using English semantics to break down passwords and identify patterns.
Hjelden, Isabelle, Isabelle Hjelden
core +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
Weighted and Probabilistic Context-Free Grammars Are Equally Expressive [PDF]
This article studies the relationship between weighted context-free grammars (WCFGs), where each production is associated with a positive real-valued weight, and probabilistic context-free grammars (PCFGs), where the weights of the productions associated with a nonterminal are constrained to sum to one. Because the class of WCFGs properly includes the
Noah A. Smith, Mark Johnson 0001
openaire +2 more sources
Fuzzy Testing of Language Interpreter Based on Improved PCFG [PDF]
In order to construct samples that conform to language norms in fuzzy testing of language interpreter,and get abnormal test results as far as possible to find vulnerabilities,the improved Probabilistic Context Free Grammar(PCFG) model is used to control ...
LIU Zhihao, SUN Xiaoshan, ZHANG Yang
doaj +1 more source
A Note on the Expressive Power of Probabilistic Context Free Grammars [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lopez, G. G. Infante, de Rijke, M.
openaire +4 more sources

