Inside-Outside Estimation Meets Dynamic EM
| dc.creator | Prescher, Detlef | |
| dc.date | 2004-12-03 | |
| dc.date.accessioned | 2026-07-07T03:22:08Z | |
| dc.date.available | 2026-07-07T03:22:08Z | |
| dc.description | We briefly review the inside-outside and EM algorithm for probabilistic context-free grammars. As a result, we formally prove that inside-outside estimation is a dynamic-programming variant of EM. This is interesting in its own right, but even more when considered in a theoretical context since the well-known convergence behavior of inside-outside estimation has been confirmed by many experiments but apparently has never been formally proved. However, being a version of EM, inside-outside estimation also inherits the good convergence behavior of EM. Therefore, the as yet imperfect line of argumentation can be transformed into a coherent proof. | |
| dc.description | 4 pages, some typos corrected | |
| dc.identifier | https://arxiv.org/abs/cs/0412016 | |
| dc.identifier | http://arxiv.org/abs/cs/0412016 | |
| dc.identifier | Proceedings of IWPT 2001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32476 | |
| dc.subject | Computation and Language | |
| dc.title | Inside-Outside Estimation Meets Dynamic EM | |
| dc.type | text |