8 search results - page 1 / 2 » Prefix Probabilities from Stochastic Tree Adjoining Grammars |
ACL
1998
13 years 6 months ago
1998
EMNLP
2009
13 years 2 months ago
2009
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
COLING
1996
13 years 6 months ago
1996
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 follo...
ACL
1998
13 years 6 months ago
1998
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
NLP
2000
13 years 8 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...