[Association for Computational Linguisti
โ
Chen, Stanley F.
๐
Article
๐
1995
๐
Association for Computational Linguistics
โ 639 KB
We describe a corpus-based induction algorithm for probabilistic context-free grammars. The algorithm employs a greedy heuristic search within a Bayesian framework, and a post-pass using the Inside-Outside algorithm. We compare the performance of our algorithm to n-gram models and the Inside-Outside