2021
Learning of Structurally Unambiguous Probabilistic Grammars
AAAI 2021technical
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 estimating probabilistic weights for each rule. Given the hardness results for learning context-free grammars in general, and…