Relating Probabilistic Grammars and Automata
Relating Probabilistic Grammars and Automata
Steven P. Abney,David A. McAllester,Fernando C Pereira
1999 · DOI: 10.3115/1034678.1034759
Annual Meeting of the Association for Computational Linguistics · 引用 77 次
TLDR
The precise relationship between Probabilistic context-free grammars and shift-reduce probabilistic pushdown automata is investigated, showing that, while they define the same classes of probabilism languages, they appear to impose different inductive biases.
摘要
Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic pushdown automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the precise relationship between these two formalisms, showing that, while they define the same classes of probabilistic languages, they appear to impose different inductive biases.