no code implementations • TACL 2020 • Alex Clark, er, Nathana{\"e}l Fijalkow
Learning probabilistic context-free grammars (PCFGs) from strings is a classic problem in computational linguistics since Horning (1969).
