Consistency of Probabilistic Context-Free Grammars
We present an algorithm for deciding whether an arbitrary proper probabilistic context-free grammar is consistent, i.e., whether the probability that a derivation terminates is one. Our procedure has time complexity $\\\\mathcal O(n^3)$ in the unit-cost model of computation. Moreover, we develop a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
2012
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-86943 http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-86943 http://www.qucosa.de/fileadmin/data/qucosa/documents/8694/gesamt.pdf |