Abstract. This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod,. 1992; Schabes and Waters, 1993).
Jun 17, 1996 · Abstract: This paper studies the computational complexity of disambiguation under probabilistic tree-grammars and context-free grammars.
The extension of grammars with probabilities makes it possible to state ambiguity resolution as a constrained optimization formula, which aims at maximizing the ...
Missing: means | Show results with:means
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993).
Abstract. Recent models of natural language processing employ statistical reason- ing for dealing with the ambiguity of formal grammars.
Preference grammars and decoding algorithms for probabilistic synchronous context free grammar based translation ... Tree Grammars · Rens Bad. Computer Science.
Missing: means | Show results with:means
Abstract. This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod,. 1992; Schabes and Waters, 1993).
[PDF] Computational Complexity of Probabilistic Disambiguation by ...
www.semanticscholar.org › paper
The existence of deterministic polynomial-time algorithms for solving disambiguation problems is a highly improbable event because the NP-hardness of ...
Tree substitution grammar (TSG) is a generalization of context-free grammar (CFG) that permits non-terminals to rewrite as fragments of arbitrary size, ...
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars. Author. Sima'an, Khalil. Conference. COLING 1996 Volume 2: The 16th ...