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
Venue:
IWPT
SIG:
SIGPARSE
Publisher:
Note:
Pages:
137–148
Language:
URL:
https://aclanthology.org/W03-3016
DOI:
Bibkey:
Cite (ACL):
Mark-Jan Nederhof and Giorgio Satta. 2003. Probabilistic Parsing as Intersection. In Proceedings of the Eighth International Conference on Parsing Technologies, pages 137–148, Nancy, France.
Cite (Informal):
Probabilistic Parsing as Intersection (Nederhof & Satta, IWPT 2003)
Copy Citation:
PDF:
https://aclanthology.org/W03-3016.pdf