Probabilistic Parsing as Intersection

Mark-Jan Nederhof, Giorgio Satta


Abstract
We show that a well-known algorithm to compute the intersection of a context-fre 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.
Anthology ID:
W03-3016
Volume:
Proceedings of the Eighth International Conference on Parsing Technologies
Month:
April
Year:
2003
Address:
Nancy, France
Venues:
IWPT | WS
SIG:
SIGPARSE
Publisher:
Note:
Pages:
137–148
Language:
URL:
https://www.aclweb.org/anthology/W03-3016
DOI:
Bib Export formats:
BibTeX MODS XML EndNote
PDF:
http://aclanthology.lst.uni-saarland.de/W03-3016.pdf