DFKI-LT - Probabilistic parsing as intersection
Probabilistic parsing as intersection
1 8th International Workshop on Parsing Technologies,
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.
Files: BibTeX, nederhof03c.pdf, nederhof03c.ps