no code implementations • 17 Mar 2022 • Dana Fisman, Dolav Nitay, Michal Ziv-Ukelson
In this work we address the first problem.
no code implementations • 15 Nov 2020 • Dolav Nitay, Dana Fisman, Michal Ziv-Ukelson
We show that the learned CMTA can be converted into a probabilistic grammar, thus providing a complete algorithm for learning a structurally unambiguous probabilistic context free grammar (both the grammar topology and the probabilistic weights) using structured membership queries and structured equivalence queries.