Probabilistic learnability of context-free grammars with basic distributional properties from positive examples (Q5964066): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: NTS languages are deterministic and congruential / rank
 
Normal rank
Property / cites work
 
Property / cites work: PAC-Learning Unambiguous NTS Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Context Free Grammars with the Syntactic Concept Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Learnable Representation for Syntax Using Residuated Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical Inference: Algorithms and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributional learning of parallel multiple context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: PAC-Learning Unambiguous k,l-NTS ≤  Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence and inclusion problems for NTS languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification in the Limit of k,l-Substitutable Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient learning of multiple context-free languages with multidimensional substitutability from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars / rank
 
Normal rank

Revision as of 11:37, 11 July 2024

scientific article; zbMATH DE number 6546611
Language Label Description Also known as
English
Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
scientific article; zbMATH DE number 6546611

    Statements

    Probabilistic learnability of context-free grammars with basic distributional properties from positive examples (English)
    0 references
    0 references
    0 references
    26 February 2016
    0 references
    grammatical inference
    0 references
    PAC learning
    0 references
    distributional learning
    0 references
    0 references
    0 references
    0 references

    Identifiers