Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
| dc.creator | Sima'an, Khalil | |
| dc.date | 1996-06-17 | |
| dc.date.accessioned | 2026-07-07T09:10:23Z | |
| dc.date.available | 2026-07-07T09:10:23Z | |
| dc.description | This paper studies the computational complexity of disambiguation under probabilistic tree-grammars and context-free grammars. It presents a proof that the following problems are NP-hard: computing the Most Probable Parse (MPP) from a sentence or from a word-graph, and computing the Most Probable Sentence (MPS) from a word-graph. The NP-hardness of computing the MPS from a word-graph also holds for Stochastic Context-Free Grammars. Consequently, the existence of deterministic polynomial-time algorithms for solving these disambiguation problems is a highly improbable event. | |
| dc.description | 6 pages. To appear in COLING 1996 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9606019 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9606019 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151338 | |
| dc.subject | Computation and Language | |
| dc.title | Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars | |
| dc.type | text |