Skip to main content Skip to main navigation


Probabilistic parsing as intersection

Mark-Jan Nederhof; Giorgio Satta
In: 8th International Workshop on Parsing Technologies. International Conference on Parsing Technologies (IWPT), LORIA, Nancy, France, Pages 137-148, 2003.


We show that a well-known algorithm to compute the intersection of a context-free language and a regular language can be extended to apply to a probabilistic context-free grammar and a probabilistic finite automaton, provided the two probabilistic models are combined through multiplication. The result is a probabilistic context-free grammar that contains joint information about the original grammar and automaton.

Weitere Links