Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars

Details Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars

1996-06-17

arxiv.org/abs/cmp-lg/9606019v1

Computer Science

Computation and Language

6 pages. To appear in COLING 1996

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19079