holds for Stochastic Context-Free Grammars
Download:
|
|
unknown authors
http://www.hum.uva.nl/computerlinguistiek/simaan/postscript/simaan-96b.ps
Add To MetaCart
Abstract:
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the following problems are NP-hard: computing the Most Probable Parse from a sentence or from a word-graph, and computing the Most Probable Sentence (MPS) from a wordgraph. The NP-hardness of computing the MPS from a word-graph also
Citations
| 78 | Probabilistic Tree-Adjoining Grammar as a Framework for Statistical Natural Language Processing – Resnik - 1992 |
| 66 | Tree adjoining grammars and lexicalized grammars – Joshi, Schabes - 1991 |
| 46 | A Computational Model of Language Performance; Data-Oriented Parising – Bod - 1992 |
| 43 | Lexicalized context-free grammars – Schabes, Waters - 1993 |
| 40 | Computational Complexity and Natural Language – Barton, Ristad - 1987 |
| 36 | An optimized algorithm for Data Oriented Parsing – Sima’an - 1995 |
| 35 | Language Theory and Language Technology; Competence and Performance – SCHA - 1990 |
| 22 | Monte Carlo Parsing – Bod - 1993 |
| 11 | The Problem of Computing the Most Probable Tree in Data-Oriented Parsing and Stochastic Tree Grammars – Bod - 1995 |
| 4 | Introduction to Automata Theory, Lanaguges, and Computation – Hopcroft, Ullman - 1979 |
| 1 | Efficient Disambiguationby means of Stochastic Tree Substitution Grammars – Sima'an, Bod, et al. - 1994 |
