In: 8th International Workshop on Parsing Technologies. International Conference on Parsing Technologies (IWPT), LORIA, Nancy, France, Pages 137-148, 2003.
Abstract
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.
@inproceedings{pub3474,
author = {
Nederhof, Mark-Jan
and
Satta, Giorgio
},
title = {Probabilistic parsing as intersection},
booktitle = {8th International Workshop on Parsing Technologies. International Conference on Parsing Technologies (IWPT), LORIA, Nancy, France},
year = {2003},
pages = {137--148}
}
German Research Center for Artificial Intelligence Deutsches Forschungszentrum für Künstliche Intelligenz
