5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.LO2022★ 5 cited
Learning of Structurally Unambiguous Probabilistic Grammars
Dana Fisman, Dolav Nitay, Michal Ziv-Ukelson
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estima…
cs.FL2020★ 1 cited
Learning of Structurally Unambiguous Probabilistic Grammars
Dolav Nitay, Dana Fisman, Michal Ziv-Ukelson
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estima…