Learning of Structurally Unambiguous Probabilistic Grammars (Q5883734): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: When won't membership queries help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of approximating distributions by probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning functions represented as multiplicity automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Behaviors of Automata from Multiplicity and Equivalence Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three models for the description of language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query learning of regular tree languages: How to avoid dead states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3404129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of automaton identification from given data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Multiplicity Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skeletal structural descriptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the properties of positive spanning sets and positive bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient learning of context-free grammars from positive structural examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted and Probabilistic Context-Free Grammars Are Equally Expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L^\ast\)-based learning of Markov decision processes (extended version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning weighted automata over principal ideal domains / rank
 
Normal rank

Latest revision as of 18:19, 31 July 2024

scientific article; zbMATH DE number 7667083
Language Label Description Also known as
English
Learning of Structurally Unambiguous Probabilistic Grammars
scientific article; zbMATH DE number 7667083

    Statements

    Learning of Structurally Unambiguous Probabilistic Grammars (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2023
    0 references
    active learning
    0 references
    learning theory
    0 references
    grammatical inference
    0 references
    multiplicity automata
    0 references
    interpretability and analysis of NLP models
    0 references

    Identifiers