stochastic context free grammars
Recently Published Documents

TOTAL DOCUMENTS

72
(FIVE YEARS 1)

H-INDEX

15
(FIVE YEARS 0)
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS

2019 ◽  
pp. 289
Author(s):  
Velimir M Ilić ◽  
Miroslav D Ćirić ◽  
Miomir S Stanković
Keyword(s):  
Random Variable ◽  
Sample Space ◽  
Efficient Computation ◽  
Context Free Grammar ◽  
Special Cases ◽  
The Cross ◽  
Stochastic Context Free Grammars ◽  
Context Free ◽  
New Algorithms ◽  
Vector Random Variable

In this paper we consider the problem of efficient computation of cross-moments of a vector random variable represented by a stochastic context-free grammar. Two types of cross-moments are discussed. The sample space for the first one is the set of all derivations of the context-free grammar, and the sample space for the second one is the set of all derivations which generate a string belonging to the language of the grammar. In the past, this problem was widely studied, but mainly for the cross-moments of scalar variables and up to the second order. This paper presents new algorithms for computing the cross-moments of an arbitrary order, while the previously developed ones are derived as special cases.

scholarly journals CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS

2018 ◽  
Vol 33 (1) ◽  
pp. 041
Author(s):  
Velimir M. Ilić ◽  
Miroslav D. Ćirić ◽  
Miomir S. Stanković
Keyword(s):  
Random Variable ◽  
Sample Space ◽  
Efficient Computation ◽  
Context Free Grammar ◽  
Special Cases ◽  
The Cross ◽  
Stochastic Context Free Grammars ◽  
Context Free ◽  
New Algorithms ◽  
Vector Random Variable

In this paper we consider the problem of efficient computation of cross-moments of a vector random variable represented by a stochastic context-free grammar. Two types of cross-moments are discussed. The sample space for the first one is the set of all derivations of the context-free grammar, and the sample space for the second one is the set of all derivations which generate a string belonging to the language of the grammar. In the past, this problem was widely studied, but mainly for the cross-moments of scalar variables and up to the second order. This paper presents new algorithms for computing the cross-moments of an arbitrary order, while the previously developed ones are derived as special cases.

scholarly journals Structure detection and segmentation of documents using 2D stochastic context-free grammars

2015 ◽  
Vol 150 ◽  
pp. 147-154 ◽  
Author(s):  
Francisco Álvaro ◽  
Francisco Cruz ◽  
Joan-Andreu Sánchez ◽  
Oriol Ramos Terrades ◽  
José-Miguel Benedí
Keyword(s):  
Structure Detection ◽  
Stochastic Context Free Grammars ◽  
Context Free ◽  
Context Free Grammars

Stochastic context-free grammars for scale-dependent intent inference

2013 ◽  
Author(s):  
Bhashyam Balaji ◽  
Mustafa Fanaswala ◽  
Vikram Krishnamurthy
Keyword(s):  
Stochastic Context Free Grammars ◽  
Context Free ◽  
Context Free Grammars

scholarly journals Oxfold: kinetic folding of RNA using stochastic context-free grammars and evolutionary information

2013 ◽  
Vol 29 (6) ◽  
pp. 704-710 ◽  
Author(s):  
James W. J. Anderson ◽  
Pierre A. Haas ◽  
Leigh-Anne Mathieson ◽  
Vladimir Volynkin ◽  
Rune Lyngsø ◽  
...  
Keyword(s):  
Evolutionary Information ◽  
Stochastic Context Free Grammars ◽  
Context Free ◽  
Context Free Grammars ◽  
Kinetic Folding
Load More ...
Sign in / Sign up

Export Citation Format

Share Document