Learning of Structurally Unambiguous Probabilistic Grammars
From MaRDI portal
Recommendations
- Learning context-free grammars from structural data in polynomial time
- Learning Cover Context-Free Grammars from Structural Data
- Learning cover context-free grammars from structural data
- Grammatical inference of PCFGs applied to language modelling and unsupervised parsing
- Learning trees from strings: a strong learning algorithm for some context-free grammars
Cites work
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Complexity of automaton identification from given data
- Efficient learning of context-free grammars from positive structural examples
- Grammatical inference. Learning automata and grammars.
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Learning functions represented as multiplicity automata
- Learning Multiplicity Tree Automata
- Learning regular sets from queries and counterexamples
- Learning weighted automata over principal ideal domains
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- On the computational complexity of approximating distributions by probabilistic automata
- On the properties of positive spanning sets and positive bases
- Query learning of regular tree languages: How to avoid dead states
- Skeletal structural descriptions
- Three models for the description of language
- Weighted and probabilistic context-free grammars are equally expressive
- When won't membership queries help?
Cited in
(12)- scientific article; zbMATH DE number 1696485 (Why is no real title available?)
- Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars
- Incremental sigmoid belief networks for grammar learning
- Language sampling for universal grammars
- scientific article; zbMATH DE number 995907 (Why is no real title available?)
- Learning discrete categorial grammars from structures
- Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning
- Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering
- scientific article; zbMATH DE number 6819790 (Why is no real title available?)
- A Spectral Approach for Probabilistic Grammatical Inference on Trees
- Inferring Symbolic Automata
- Learning and characterizing fully-ordered lattice automata
This page was built for publication: Learning of Structurally Unambiguous Probabilistic Grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883734)
