Learning of Structurally Unambiguous Probabilistic Grammars
From MaRDI portal
Publication:5883734
DOI10.46298/lmcs-19(1:10)2023OpenAlexW3104597427MaRDI QIDQ5883734
Michal Ziv-Ukelson, Unnamed Author, Dana Fisman
Publication date: 22 March 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.09441v3
learning theorygrammatical inferenceactive learningmultiplicity automatainterpretability and analysis of NLP models
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- Query learning of regular tree languages: How to avoid dead states
- Learning regular sets from queries and counterexamples
- Efficient learning of context-free grammars from positive structural examples
- On the computational complexity of approximating distributions by probabilistic automata
- When won't membership queries help?
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Learning weighted automata over principal ideal domains
- On the properties of positive spanning sets and positive bases
- Weighted and Probabilistic Context-Free Grammars Are Equally Expressive
- Learning Multiplicity Tree Automata
- Complexity of automaton identification from given data
- Skeletal structural descriptions
- Learning functions represented as multiplicity automata
- Three models for the description of language
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
This page was built for publication: Learning of Structurally Unambiguous Probabilistic Grammars
